./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0724aefed4fd629206cc51e19e964e04af92729823366947a0cfe01fe4e4d102 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:07:40,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:07:40,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:07:40,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:07:40,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:07:40,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:07:40,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:07:40,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:07:40,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:07:40,671 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:07:40,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:07:40,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:07:40,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:07:40,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:07:40,673 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:07:40,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:07:40,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:07:40,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:07:40,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:07:40,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:07:40,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:07:40,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:07:40,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:07:40,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:07:40,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:07:40,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:07:40,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:07:40,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:07:40,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:07:40,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:07:40,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:07:40,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:07:40,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:07:40,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:07:40,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:07:40,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:07:40,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:07:40,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:07:40,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:07:40,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:07:40,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:07:40,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:07:40,692 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0724aefed4fd629206cc51e19e964e04af92729823366947a0cfe01fe4e4d102 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:07:40,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:07:40,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:07:40,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:07:40,978 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:07:40,979 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:07:40,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2024-09-25 00:07:42,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:07:42,649 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:07:42,649 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2024-09-25 00:07:42,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5f2b55d09/df48335029224026bd3a5563ccc22b58/FLAGd644b3f03 [2024-09-25 00:07:43,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5f2b55d09/df48335029224026bd3a5563ccc22b58 [2024-09-25 00:07:43,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:07:43,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:07:43,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:07:43,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:07:43,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:07:43,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:07:43" (1/1) ... [2024-09-25 00:07:43,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a08235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43, skipping insertion in model container [2024-09-25 00:07:43,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:07:43" (1/1) ... [2024-09-25 00:07:43,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:07:43,234 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c[946,959] [2024-09-25 00:07:43,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:07:43,261 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:07:43,277 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c[946,959] [2024-09-25 00:07:43,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:07:43,296 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:07:43,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43 WrapperNode [2024-09-25 00:07:43,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:07:43,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:07:43,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:07:43,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:07:43,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43" (1/1) ... [2024-09-25 00:07:43,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43" (1/1) ... [2024-09-25 00:07:43,327 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:07:43,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:07:43,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:07:43,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:07:43,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:07:43,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43" (1/1) ... [2024-09-25 00:07:43,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43" (1/1) ... [2024-09-25 00:07:43,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43" (1/1) ... [2024-09-25 00:07:43,356 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 00:07:43,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43" (1/1) ... [2024-09-25 00:07:43,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43" (1/1) ... [2024-09-25 00:07:43,360 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43" (1/1) ... [2024-09-25 00:07:43,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43" (1/1) ... [2024-09-25 00:07:43,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43" (1/1) ... [2024-09-25 00:07:43,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43" (1/1) ... [2024-09-25 00:07:43,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:07:43,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:07:43,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:07:43,367 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:07:43,367 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43" (1/1) ... [2024-09-25 00:07:43,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:07:43,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:07:43,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 00:07:43,401 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 00:07:43,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:07:43,455 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:07:43,455 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:07:43,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:07:43,455 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-09-25 00:07:43,455 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-09-25 00:07:43,456 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-09-25 00:07:43,456 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-09-25 00:07:43,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:07:43,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:07:43,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:07:43,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:07:43,529 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:07:43,531 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:07:43,686 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-25 00:07:43,688 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:07:43,720 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:07:43,721 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 00:07:43,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:07:43 BoogieIcfgContainer [2024-09-25 00:07:43,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:07:43,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:07:43,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:07:43,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:07:43,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:07:43" (1/3) ... [2024-09-25 00:07:43,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619b5b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:07:43, skipping insertion in model container [2024-09-25 00:07:43,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:07:43" (2/3) ... [2024-09-25 00:07:43,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619b5b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:07:43, skipping insertion in model container [2024-09-25 00:07:43,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:07:43" (3/3) ... [2024-09-25 00:07:43,736 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2024-09-25 00:07:43,755 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:07:43,756 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:07:43,825 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:07:43,834 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@56eb1b3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:07:43,834 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:07:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 00:07:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 00:07:43,847 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:07:43,847 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:07:43,848 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:07:43,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:43,854 INFO L85 PathProgramCache]: Analyzing trace with hash -685851838, now seen corresponding path program 1 times [2024-09-25 00:07:43,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:07:43,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158506109] [2024-09-25 00:07:43,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:43,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:07:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:44,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:07:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:44,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:07:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:07:44,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:07:44,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158506109] [2024-09-25 00:07:44,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158506109] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:07:44,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:07:44,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:07:44,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165968710] [2024-09-25 00:07:44,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:07:44,190 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:07:44,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:07:44,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:07:44,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:07:44,219 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:07:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:07:44,350 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-09-25 00:07:44,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:07:44,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-09-25 00:07:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:07:44,361 INFO L225 Difference]: With dead ends: 44 [2024-09-25 00:07:44,361 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 00:07:44,365 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:07:44,371 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:07:44,373 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 103 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:07:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 00:07:44,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-09-25 00:07:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-25 00:07:44,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-09-25 00:07:44,431 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2024-09-25 00:07:44,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:07:44,431 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-09-25 00:07:44,431 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:07:44,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:44,432 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-09-25 00:07:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 00:07:44,434 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:07:44,434 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:07:44,435 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:07:44,436 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:07:44,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash 924954813, now seen corresponding path program 1 times [2024-09-25 00:07:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:07:44,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949803738] [2024-09-25 00:07:44,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:07:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:44,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:07:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:44,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:07:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:07:44,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:07:44,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949803738] [2024-09-25 00:07:44,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949803738] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:07:44,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:07:44,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:07:44,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349867225] [2024-09-25 00:07:44,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:07:44,582 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:07:44,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:07:44,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:07:44,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:07:44,584 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:07:44,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:07:44,675 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-09-25 00:07:44,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:07:44,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-09-25 00:07:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:07:44,677 INFO L225 Difference]: With dead ends: 36 [2024-09-25 00:07:44,678 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 00:07:44,678 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:07:44,679 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:07:44,680 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:07:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 00:07:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-09-25 00:07:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-25 00:07:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-09-25 00:07:44,709 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2024-09-25 00:07:44,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:07:44,709 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-09-25 00:07:44,711 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:07:44,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-09-25 00:07:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-25 00:07:44,716 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:07:44,716 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:07:44,717 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 00:07:44,717 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:07:44,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1782416332, now seen corresponding path program 1 times [2024-09-25 00:07:44,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:07:44,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952714811] [2024-09-25 00:07:44,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:44,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:07:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:44,809 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:07:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:44,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:07:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:44,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:44,904 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-25 00:07:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:07:44,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:07:44,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952714811] [2024-09-25 00:07:44,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952714811] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:07:44,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337568443] [2024-09-25 00:07:44,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:44,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:44,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:07:44,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:07:44,924 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 00:07:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:44,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 00:07:44,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:07:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:07:45,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:07:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:07:45,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337568443] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:07:45,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:07:45,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-09-25 00:07:45,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556317172] [2024-09-25 00:07:45,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:07:45,334 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 00:07:45,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:07:45,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 00:07:45,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:07:45,335 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-25 00:07:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:07:45,524 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2024-09-25 00:07:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 00:07:45,525 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) Word has length 26 [2024-09-25 00:07:45,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:07:45,527 INFO L225 Difference]: With dead ends: 58 [2024-09-25 00:07:45,527 INFO L226 Difference]: Without dead ends: 34 [2024-09-25 00:07:45,528 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-09-25 00:07:45,529 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 25 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:07:45,529 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 160 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:07:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-25 00:07:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-09-25 00:07:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-25 00:07:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-09-25 00:07:45,543 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2024-09-25 00:07:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:07:45,543 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-09-25 00:07:45,543 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-25 00:07:45,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-09-25 00:07:45,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 00:07:45,545 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:07:45,545 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:07:45,559 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 00:07:45,746 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:45,746 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:07:45,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:45,747 INFO L85 PathProgramCache]: Analyzing trace with hash -836643613, now seen corresponding path program 1 times [2024-09-25 00:07:45,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:07:45,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118679974] [2024-09-25 00:07:45,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:45,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:07:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:45,803 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:07:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:45,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:07:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:45,860 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:45,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:07:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:07:45,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:07:45,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118679974] [2024-09-25 00:07:45,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118679974] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:07:45,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877194373] [2024-09-25 00:07:45,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:45,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:45,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:07:45,912 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:07:45,914 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 00:07:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:45,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 00:07:45,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:07:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:07:46,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:07:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:07:46,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877194373] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:07:46,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:07:46,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-09-25 00:07:46,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112298074] [2024-09-25 00:07:46,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:07:46,251 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 00:07:46,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:07:46,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 00:07:46,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:07:46,252 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 00:07:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:07:46,487 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-09-25 00:07:46,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 00:07:46,488 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Word has length 27 [2024-09-25 00:07:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:07:46,491 INFO L225 Difference]: With dead ends: 56 [2024-09-25 00:07:46,491 INFO L226 Difference]: Without dead ends: 52 [2024-09-25 00:07:46,493 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-09-25 00:07:46,495 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:07:46,497 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 182 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:07:46,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-25 00:07:46,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-09-25 00:07:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-25 00:07:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2024-09-25 00:07:46,517 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 27 [2024-09-25 00:07:46,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:07:46,518 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2024-09-25 00:07:46,518 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 00:07:46,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2024-09-25 00:07:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-25 00:07:46,520 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:07:46,520 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:07:46,535 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 00:07:46,721 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:46,722 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:07:46,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:46,723 INFO L85 PathProgramCache]: Analyzing trace with hash -925704228, now seen corresponding path program 1 times [2024-09-25 00:07:46,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:07:46,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775048307] [2024-09-25 00:07:46,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:46,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:07:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:46,774 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:07:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:46,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:07:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:46,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:46,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:46,898 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-25 00:07:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:46,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 00:07:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:07:46,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:07:46,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775048307] [2024-09-25 00:07:46,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775048307] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:07:46,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58614984] [2024-09-25 00:07:46,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:46,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:46,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:07:46,908 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:07:46,909 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 00:07:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:46,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 00:07:46,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:07:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 00:07:47,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:07:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:07:47,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58614984] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:07:47,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:07:47,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-09-25 00:07:47,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027391394] [2024-09-25 00:07:47,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:07:47,403 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 00:07:47,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:07:47,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 00:07:47,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-09-25 00:07:47,408 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 00:07:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:07:47,673 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2024-09-25 00:07:47,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 00:07:47,674 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) Word has length 39 [2024-09-25 00:07:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:07:47,676 INFO L225 Difference]: With dead ends: 112 [2024-09-25 00:07:47,676 INFO L226 Difference]: Without dead ends: 68 [2024-09-25 00:07:47,678 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-09-25 00:07:47,679 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:07:47,679 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 200 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:07:47,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-25 00:07:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-09-25 00:07:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (30), 14 states have call predecessors, (30), 13 states have call successors, (30) [2024-09-25 00:07:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2024-09-25 00:07:47,695 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2024-09-25 00:07:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:07:47,695 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2024-09-25 00:07:47,695 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 00:07:47,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2024-09-25 00:07:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 00:07:47,700 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:07:47,701 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:07:47,718 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 00:07:47,905 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:47,906 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:07:47,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:47,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1261961157, now seen corresponding path program 1 times [2024-09-25 00:07:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:07:47,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452334058] [2024-09-25 00:07:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:47,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:07:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:47,969 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:07:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:47,979 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:07:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:48,019 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:48,090 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:48,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:07:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:48,104 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:07:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-25 00:07:48,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:07:48,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452334058] [2024-09-25 00:07:48,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452334058] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:07:48,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048169115] [2024-09-25 00:07:48,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:48,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:48,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:07:48,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:07:48,129 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 00:07:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:48,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 00:07:48,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:07:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:07:48,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:07:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:07:48,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048169115] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:07:48,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:07:48,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 17 [2024-09-25 00:07:48,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286960554] [2024-09-25 00:07:48,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:07:48,568 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 00:07:48,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:07:48,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 00:07:48,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-09-25 00:07:48,571 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2024-09-25 00:07:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:07:48,902 INFO L93 Difference]: Finished difference Result 182 states and 328 transitions. [2024-09-25 00:07:48,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 00:07:48,902 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) Word has length 40 [2024-09-25 00:07:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:07:48,908 INFO L225 Difference]: With dead ends: 182 [2024-09-25 00:07:48,908 INFO L226 Difference]: Without dead ends: 122 [2024-09-25 00:07:48,910 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-09-25 00:07:48,916 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 37 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:07:48,917 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 268 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:07:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-09-25 00:07:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2024-09-25 00:07:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.21875) internal successors, (78), 67 states have internal predecessors, (78), 23 states have call successors, (23), 9 states have call predecessors, (23), 15 states have return successors, (64), 26 states have call predecessors, (64), 22 states have call successors, (64) [2024-09-25 00:07:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 165 transitions. [2024-09-25 00:07:48,963 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 165 transitions. Word has length 40 [2024-09-25 00:07:48,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:07:48,964 INFO L474 AbstractCegarLoop]: Abstraction has 103 states and 165 transitions. [2024-09-25 00:07:48,964 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2024-09-25 00:07:48,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 165 transitions. [2024-09-25 00:07:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-25 00:07:48,971 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:07:48,971 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:07:48,991 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 00:07:49,171 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:49,172 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:07:49,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:49,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1624375296, now seen corresponding path program 1 times [2024-09-25 00:07:49,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:07:49,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345295215] [2024-09-25 00:07:49,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:49,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:07:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:49,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:07:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:49,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:07:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:49,263 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:49,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:49,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:49,370 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:07:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:49,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:07:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:49,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 00:07:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-25 00:07:49,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:07:49,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345295215] [2024-09-25 00:07:49,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345295215] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:07:49,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332835566] [2024-09-25 00:07:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:49,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:49,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:07:49,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:07:49,394 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 00:07:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:49,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 00:07:49,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:07:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-25 00:07:49,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:07:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-25 00:07:49,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332835566] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:07:49,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:07:49,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2024-09-25 00:07:49,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382077202] [2024-09-25 00:07:49,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:07:49,834 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 00:07:49,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:07:49,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 00:07:49,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-09-25 00:07:49,835 INFO L87 Difference]: Start difference. First operand 103 states and 165 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-25 00:07:50,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:07:50,082 INFO L93 Difference]: Finished difference Result 265 states and 513 transitions. [2024-09-25 00:07:50,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 00:07:50,082 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) Word has length 54 [2024-09-25 00:07:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:07:50,086 INFO L225 Difference]: With dead ends: 265 [2024-09-25 00:07:50,086 INFO L226 Difference]: Without dead ends: 168 [2024-09-25 00:07:50,087 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-09-25 00:07:50,088 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:07:50,088 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 185 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:07:50,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-09-25 00:07:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 142. [2024-09-25 00:07:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 89 states have (on average 1.202247191011236) internal successors, (107), 91 states have internal predecessors, (107), 33 states have call successors, (33), 12 states have call predecessors, (33), 19 states have return successors, (104), 38 states have call predecessors, (104), 32 states have call successors, (104) [2024-09-25 00:07:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 244 transitions. [2024-09-25 00:07:50,119 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 244 transitions. Word has length 54 [2024-09-25 00:07:50,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:07:50,120 INFO L474 AbstractCegarLoop]: Abstraction has 142 states and 244 transitions. [2024-09-25 00:07:50,120 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 10 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-25 00:07:50,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 244 transitions. [2024-09-25 00:07:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-25 00:07:50,123 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:07:50,124 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:07:50,142 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 00:07:50,327 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 00:07:50,328 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:07:50,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:50,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1735862535, now seen corresponding path program 1 times [2024-09-25 00:07:50,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:07:50,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846118348] [2024-09-25 00:07:50,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:50,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:07:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:50,371 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:07:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:50,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:07:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:50,426 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:50,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:50,525 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:50,529 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:07:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:50,533 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:07:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:50,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:07:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:50,560 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 00:07:50,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:07:50,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846118348] [2024-09-25 00:07:50,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846118348] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:07:50,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725986464] [2024-09-25 00:07:50,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:50,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:50,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:07:50,563 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:07:50,565 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 00:07:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:50,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 00:07:50,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:07:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-09-25 00:07:50,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:07:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-09-25 00:07:50,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725986464] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:07:50,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:07:50,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2024-09-25 00:07:50,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090015709] [2024-09-25 00:07:50,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:07:50,869 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 00:07:50,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:07:50,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 00:07:50,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-09-25 00:07:50,870 INFO L87 Difference]: Start difference. First operand 142 states and 244 transitions. Second operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2024-09-25 00:07:51,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:07:51,181 INFO L93 Difference]: Finished difference Result 347 states and 700 transitions. [2024-09-25 00:07:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 00:07:51,182 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) Word has length 55 [2024-09-25 00:07:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:07:51,184 INFO L225 Difference]: With dead ends: 347 [2024-09-25 00:07:51,185 INFO L226 Difference]: Without dead ends: 120 [2024-09-25 00:07:51,187 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-09-25 00:07:51,188 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 40 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:07:51,188 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 286 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:07:51,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-09-25 00:07:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2024-09-25 00:07:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.180327868852459) internal successors, (72), 62 states have internal predecessors, (72), 22 states have call successors, (22), 9 states have call predecessors, (22), 13 states have return successors, (65), 25 states have call predecessors, (65), 21 states have call successors, (65) [2024-09-25 00:07:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 159 transitions. [2024-09-25 00:07:51,219 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 159 transitions. Word has length 55 [2024-09-25 00:07:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:07:51,220 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 159 transitions. [2024-09-25 00:07:51,220 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 8 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2024-09-25 00:07:51,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 159 transitions. [2024-09-25 00:07:51,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-25 00:07:51,222 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:07:51,222 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:07:51,239 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 00:07:51,426 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:51,427 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:07:51,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:51,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1987254780, now seen corresponding path program 2 times [2024-09-25 00:07:51,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:07:51,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676459426] [2024-09-25 00:07:51,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:51,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:07:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:51,497 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:07:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:51,500 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:07:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:51,560 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:51,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:51,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:51,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:07:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:51,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:07:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:51,677 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:07:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:51,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:51,715 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:07:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:51,746 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 37 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-25 00:07:51,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:07:51,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676459426] [2024-09-25 00:07:51,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676459426] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:07:51,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274633243] [2024-09-25 00:07:51,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:07:51,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:51,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:07:51,749 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:07:51,751 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 00:07:51,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:07:51,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:07:51,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 00:07:51,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:07:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-09-25 00:07:51,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:07:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-09-25 00:07:52,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274633243] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:07:52,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:07:52,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 9] total 22 [2024-09-25 00:07:52,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833141333] [2024-09-25 00:07:52,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:07:52,245 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-25 00:07:52,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:07:52,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-25 00:07:52,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-09-25 00:07:52,246 INFO L87 Difference]: Start difference. First operand 97 states and 159 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (23), 14 states have call predecessors, (23), 12 states have call successors, (23) [2024-09-25 00:07:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:07:52,642 INFO L93 Difference]: Finished difference Result 192 states and 339 transitions. [2024-09-25 00:07:52,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-25 00:07:52,643 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (23), 14 states have call predecessors, (23), 12 states have call successors, (23) Word has length 69 [2024-09-25 00:07:52,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:07:52,646 INFO L225 Difference]: With dead ends: 192 [2024-09-25 00:07:52,647 INFO L226 Difference]: Without dead ends: 89 [2024-09-25 00:07:52,648 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 148 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2024-09-25 00:07:52,650 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 63 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:07:52,650 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 274 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:07:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-09-25 00:07:52,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2024-09-25 00:07:52,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.150943396226415) internal successors, (61), 52 states have internal predecessors, (61), 14 states have call successors, (14), 10 states have call predecessors, (14), 12 states have return successors, (32), 17 states have call predecessors, (32), 13 states have call successors, (32) [2024-09-25 00:07:52,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2024-09-25 00:07:52,671 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 69 [2024-09-25 00:07:52,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:07:52,671 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2024-09-25 00:07:52,672 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (23), 14 states have call predecessors, (23), 12 states have call successors, (23) [2024-09-25 00:07:52,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2024-09-25 00:07:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-25 00:07:52,674 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:07:52,674 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:07:52,693 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-25 00:07:52,878 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:52,879 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:07:52,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2144655573, now seen corresponding path program 1 times [2024-09-25 00:07:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:07:52,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044415407] [2024-09-25 00:07:52,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:07:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:53,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:07:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:53,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:07:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:53,143 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:53,198 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:53,256 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:53,274 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:07:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:53,294 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:07:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:53,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:07:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:53,336 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:53,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:07:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-09-25 00:07:53,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:07:53,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044415407] [2024-09-25 00:07:53,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044415407] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:07:53,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76116476] [2024-09-25 00:07:53,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:53,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:53,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:07:53,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:07:53,370 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 00:07:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:53,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-25 00:07:53,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:07:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-09-25 00:07:53,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:07:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-09-25 00:07:53,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76116476] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:07:53,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:07:53,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 21 [2024-09-25 00:07:53,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412849422] [2024-09-25 00:07:53,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:07:53,785 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 00:07:53,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:07:53,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 00:07:53,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-09-25 00:07:53,786 INFO L87 Difference]: Start difference. First operand 80 states and 107 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-25 00:07:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:07:53,904 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2024-09-25 00:07:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 00:07:53,904 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) Word has length 68 [2024-09-25 00:07:53,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:07:53,906 INFO L225 Difference]: With dead ends: 97 [2024-09-25 00:07:53,906 INFO L226 Difference]: Without dead ends: 93 [2024-09-25 00:07:53,906 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-09-25 00:07:53,907 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:07:53,909 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 587 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:07:53,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-25 00:07:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-09-25 00:07:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 16 states have call successors, (16), 10 states have call predecessors, (16), 14 states have return successors, (39), 21 states have call predecessors, (39), 15 states have call successors, (39) [2024-09-25 00:07:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2024-09-25 00:07:53,926 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 68 [2024-09-25 00:07:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:07:53,927 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2024-09-25 00:07:53,927 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (13), 13 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-25 00:07:53,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2024-09-25 00:07:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-25 00:07:53,928 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:07:53,928 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:07:53,946 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-25 00:07:54,129 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:54,129 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:07:54,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:54,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2028010288, now seen corresponding path program 1 times [2024-09-25 00:07:54,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:07:54,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474506799] [2024-09-25 00:07:54,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:07:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:54,181 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:07:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:54,183 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:07:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:54,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:54,237 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:54,255 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:54,270 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:07:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:54,292 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-25 00:07:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:54,295 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:07:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:54,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:07:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:54,301 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:07:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-25 00:07:54,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:07:54,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474506799] [2024-09-25 00:07:54,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474506799] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:07:54,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362521647] [2024-09-25 00:07:54,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:07:54,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:07:54,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:07:54,306 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:07:54,307 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 00:07:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:07:54,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 00:07:54,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:07:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-09-25 00:07:54,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:07:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-25 00:07:54,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362521647] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:07:54,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:07:54,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2024-09-25 00:07:54,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56288281] [2024-09-25 00:07:54,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:07:54,962 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 00:07:54,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:07:54,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 00:07:54,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-09-25 00:07:54,963 INFO L87 Difference]: Start difference. First operand 90 states and 122 transitions. Second operand has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) [2024-09-25 00:07:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:07:55,177 INFO L93 Difference]: Finished difference Result 162 states and 237 transitions. [2024-09-25 00:07:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 00:07:55,177 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) Word has length 69 [2024-09-25 00:07:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:07:55,178 INFO L225 Difference]: With dead ends: 162 [2024-09-25 00:07:55,178 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:07:55,179 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 150 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-09-25 00:07:55,180 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:07:55,180 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 224 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:07:55,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:07:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:07:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 00:07:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:07:55,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2024-09-25 00:07:55,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:07:55,181 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:07:55,182 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) [2024-09-25 00:07:55,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:07:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:07:55,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:07:55,185 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:07:55,203 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-25 00:07:55,385 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 00:07:55,389 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:07:55,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:07:57,687 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:07:57,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:07:57 BoogieIcfgContainer [2024-09-25 00:07:57,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:07:57,713 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:07:57,713 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:07:57,713 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:07:57,714 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:07:43" (3/4) ... [2024-09-25 00:07:57,716 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:07:57,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:07:57,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:07:57,772 INFO L158 Benchmark]: Toolchain (without parser) took 14729.56ms. Allocated memory was 155.2MB in the beginning and 243.3MB in the end (delta: 88.1MB). Free memory was 107.5MB in the beginning and 124.6MB in the end (delta: -17.1MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2024-09-25 00:07:57,772 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:07:57,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.85ms. Allocated memory is still 155.2MB. Free memory was 107.5MB in the beginning and 95.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 00:07:57,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.63ms. Allocated memory is still 155.2MB. Free memory was 95.0MB in the beginning and 94.3MB in the end (delta: 769.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:07:57,773 INFO L158 Benchmark]: Boogie Preprocessor took 37.39ms. Allocated memory is still 155.2MB. Free memory was 94.3MB in the beginning and 92.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:07:57,774 INFO L158 Benchmark]: RCFGBuilder took 356.17ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 80.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 00:07:57,774 INFO L158 Benchmark]: TraceAbstraction took 13986.02ms. Allocated memory was 155.2MB in the beginning and 243.3MB in the end (delta: 88.1MB). Free memory was 79.6MB in the beginning and 127.7MB in the end (delta: -48.1MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2024-09-25 00:07:57,775 INFO L158 Benchmark]: Witness Printer took 58.09ms. Allocated memory is still 243.3MB. Free memory was 127.7MB in the beginning and 124.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:07:57,776 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.85ms. Allocated memory is still 155.2MB. Free memory was 107.5MB in the beginning and 95.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.63ms. Allocated memory is still 155.2MB. Free memory was 95.0MB in the beginning and 94.3MB in the end (delta: 769.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.39ms. Allocated memory is still 155.2MB. Free memory was 94.3MB in the beginning and 92.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 356.17ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 80.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13986.02ms. Allocated memory was 155.2MB in the beginning and 243.3MB in the end (delta: 88.1MB). Free memory was 79.6MB in the beginning and 127.7MB in the end (delta: -48.1MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. * Witness Printer took 58.09ms. Allocated memory is still 243.3MB. Free memory was 127.7MB in the beginning and 124.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 41]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 365 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 295 mSDsluCounter, 2557 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2223 mSDsCounter, 242 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2532 IncrementalHoareTripleChecker+Invalid, 2774 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 242 mSolverCounterUnsat, 334 mSDtfsCounter, 2532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1186 GetRequests, 979 SyntacticMatches, 27 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=7, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 90 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 921 NumberOfCodeBlocks, 921 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1339 ConstructedInterpolants, 0 QuantifiedInterpolants, 2751 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1164 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 816/1143 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2. Ensures: (((((\result == 1) && (n == 1)) || (\result == 0)) || (1 < n)) && (((((\result == 1) && (n == 1)) || (n < 1)) || (3 < n)) || ((\result == 1) && (2 == n)))) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1. Ensures: (((((\result == 1) || (n < 1)) || (2 < n)) && (((\result == 0) || (1 < n)) || (n == 1))) && ((((3 == n) || (4 < n)) || (n < 2)) || ((3 == \result) && (n == 4)))) RESULT: Ultimate proved your program to be correct! [2024-09-25 00:07:57,805 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE