./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 ca4ee3dd Calling Ultimate with: /root/.sdkman/candidates/java/current/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-ca4ee3d-m [2024-09-20 19:49:31,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 19:49:31,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 19:49:31,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 19:49:31,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 19:49:31,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 19:49:31,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 19:49:31,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 19:49:31,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 19:49:31,229 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 19:49:31,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 19:49:31,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 19:49:31,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 19:49:31,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 19:49:31,230 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 19:49:31,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 19:49:31,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 19:49:31,231 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 19:49:31,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 19:49:31,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 19:49:31,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 19:49:31,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 19:49:31,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 19:49:31,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 19:49:31,234 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 19:49:31,234 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 19:49:31,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 19:49:31,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 19:49:31,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 19:49:31,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 19:49:31,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 19:49:31,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 19:49:31,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:49:31,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 19:49:31,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 19:49:31,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 19:49:31,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 19:49:31,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 19:49:31,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 19:49:31,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 19:49:31,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 19:49:31,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 19:49:31,239 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-20 19:49:31,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 19:49:31,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 19:49:31,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 19:49:31,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 19:49:31,454 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 19:49:31,455 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-20 19:49:32,682 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 19:49:32,811 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 19:49:32,812 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_4-1.c [2024-09-20 19:49:32,822 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e4284da40/ceb2c5c081324fa8be4b0282e13a0e6c/FLAG4326b4881 [2024-09-20 19:49:33,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e4284da40/ceb2c5c081324fa8be4b0282e13a0e6c [2024-09-20 19:49:33,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 19:49:33,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 19:49:33,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 19:49:33,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 19:49:33,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 19:49:33,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:49:33" (1/1) ... [2024-09-20 19:49:33,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2049c5a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33, skipping insertion in model container [2024-09-20 19:49:33,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:49:33" (1/1) ... [2024-09-20 19:49:33,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 19:49:33,406 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-20 19:49:33,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:49:33,424 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 19:49:33,437 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-20 19:49:33,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:49:33,451 INFO L204 MainTranslator]: Completed translation [2024-09-20 19:49:33,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33 WrapperNode [2024-09-20 19:49:33,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 19:49:33,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 19:49:33,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 19:49:33,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 19:49:33,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33" (1/1) ... [2024-09-20 19:49:33,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33" (1/1) ... [2024-09-20 19:49:33,468 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 19:49:33,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 19:49:33,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 19:49:33,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 19:49:33,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 19:49:33,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33" (1/1) ... [2024-09-20 19:49:33,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33" (1/1) ... [2024-09-20 19:49:33,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33" (1/1) ... [2024-09-20 19:49:33,498 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-20 19:49:33,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33" (1/1) ... [2024-09-20 19:49:33,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33" (1/1) ... [2024-09-20 19:49:33,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33" (1/1) ... [2024-09-20 19:49:33,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33" (1/1) ... [2024-09-20 19:49:33,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33" (1/1) ... [2024-09-20 19:49:33,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33" (1/1) ... [2024-09-20 19:49:33,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 19:49:33,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 19:49:33,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 19:49:33,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 19:49:33,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33" (1/1) ... [2024-09-20 19:49:33,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:49:33,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:49:33,533 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-20 19:49:33,541 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-20 19:49:33,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 19:49:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 19:49:33,571 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 19:49:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 19:49:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-09-20 19:49:33,571 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-09-20 19:49:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-09-20 19:49:33,572 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-09-20 19:49:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 19:49:33,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 19:49:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 19:49:33,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 19:49:33,619 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 19:49:33,621 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 19:49:33,721 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-20 19:49:33,721 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 19:49:33,744 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 19:49:33,744 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-20 19:49:33,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:49:33 BoogieIcfgContainer [2024-09-20 19:49:33,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 19:49:33,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 19:49:33,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 19:49:33,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 19:49:33,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 07:49:33" (1/3) ... [2024-09-20 19:49:33,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a2e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:49:33, skipping insertion in model container [2024-09-20 19:49:33,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:49:33" (2/3) ... [2024-09-20 19:49:33,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a2e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:49:33, skipping insertion in model container [2024-09-20 19:49:33,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:49:33" (3/3) ... [2024-09-20 19:49:33,753 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2024-09-20 19:49:33,764 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 19:49:33,764 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 19:49:33,804 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 19:49:33,808 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;@76ee2e68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 19:49:33,809 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 19:49:33,811 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-20 19:49:33,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-20 19:49:33,816 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:49:33,817 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:49:33,817 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:49:33,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:33,822 INFO L85 PathProgramCache]: Analyzing trace with hash -685851838, now seen corresponding path program 1 times [2024-09-20 19:49:33,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:49:33,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845703196] [2024-09-20 19:49:33,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:33,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:49:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:33,979 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:49:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:33,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:49:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:34,044 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-20 19:49:34,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:49:34,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845703196] [2024-09-20 19:49:34,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845703196] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:49:34,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:49:34,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 19:49:34,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687654630] [2024-09-20 19:49:34,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:49:34,050 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:49:34,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:49:34,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:49:34,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:49:34,072 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-20 19:49:34,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:49:34,155 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-09-20 19:49:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 19:49:34,157 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-20 19:49:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:49:34,163 INFO L225 Difference]: With dead ends: 44 [2024-09-20 19:49:34,164 INFO L226 Difference]: Without dead ends: 32 [2024-09-20 19:49:34,166 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-20 19:49:34,170 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-20 19:49:34,171 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-20 19:49:34,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-20 19:49:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-09-20 19:49:34,199 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-20 19:49:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-09-20 19:49:34,201 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2024-09-20 19:49:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:49:34,201 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-09-20 19:49:34,201 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-20 19:49:34,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-09-20 19:49:34,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-20 19:49:34,203 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:49:34,203 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:49:34,203 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 19:49:34,203 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:49:34,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash 924954813, now seen corresponding path program 1 times [2024-09-20 19:49:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:49:34,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071366526] [2024-09-20 19:49:34,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:34,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:49:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:34,257 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:49:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:34,262 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:49:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:34,298 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-20 19:49:34,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:49:34,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071366526] [2024-09-20 19:49:34,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071366526] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:49:34,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:49:34,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 19:49:34,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860277717] [2024-09-20 19:49:34,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:49:34,301 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:49:34,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:49:34,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:49:34,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:49:34,302 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-20 19:49:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:49:34,354 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-09-20 19:49:34,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 19:49:34,355 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-20 19:49:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:49:34,356 INFO L225 Difference]: With dead ends: 36 [2024-09-20 19:49:34,356 INFO L226 Difference]: Without dead ends: 32 [2024-09-20 19:49:34,357 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-20 19:49:34,358 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.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:49:34,358 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.0s Time] [2024-09-20 19:49:34,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-20 19:49:34,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-09-20 19:49:34,364 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-20 19:49:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-09-20 19:49:34,365 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2024-09-20 19:49:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:49:34,366 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-09-20 19:49:34,366 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-20 19:49:34,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-09-20 19:49:34,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-20 19:49:34,367 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:49:34,367 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-20 19:49:34,367 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 19:49:34,368 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:49:34,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1782416332, now seen corresponding path program 1 times [2024-09-20 19:49:34,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:49:34,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43485406] [2024-09-20 19:49:34,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:34,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:49:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:34,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:49:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:34,442 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:49:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:34,498 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:34,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-20 19:49:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:34,534 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-20 19:49:34,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:49:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43485406] [2024-09-20 19:49:34,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43485406] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:49:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146720494] [2024-09-20 19:49:34,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:34,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:49:34,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:49:34,537 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-20 19:49:34,538 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-20 19:49:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:34,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 19:49:34,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:49:34,678 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-20 19:49:34,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:49:34,852 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-20 19:49:34,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146720494] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:49:34,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:49:34,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-09-20 19:49:34,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966808467] [2024-09-20 19:49:34,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:49:34,853 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-20 19:49:34,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:49:34,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-20 19:49:34,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-09-20 19:49:34,855 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-20 19:49:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:49:34,977 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2024-09-20 19:49:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 19:49:34,978 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-20 19:49:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:49:34,979 INFO L225 Difference]: With dead ends: 58 [2024-09-20 19:49:34,979 INFO L226 Difference]: Without dead ends: 34 [2024-09-20 19:49:34,980 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-20 19:49:34,981 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-20 19:49:34,982 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-20 19:49:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-20 19:49:34,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-09-20 19:49:34,987 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-20 19:49:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-09-20 19:49:34,988 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2024-09-20 19:49:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:49:34,988 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-09-20 19:49:34,988 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-20 19:49:34,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-09-20 19:49:34,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-20 19:49:34,991 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:49:34,991 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-20 19:49:35,003 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 19:49:35,192 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-20 19:49:35,192 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:49:35,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash -836643613, now seen corresponding path program 1 times [2024-09-20 19:49:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:49:35,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50943978] [2024-09-20 19:49:35,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:49:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:35,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:49:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:35,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:49:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:35,290 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:35,310 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:49:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:35,318 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-20 19:49:35,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:49:35,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50943978] [2024-09-20 19:49:35,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50943978] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:49:35,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120118777] [2024-09-20 19:49:35,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:35,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:49:35,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:49:35,321 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-20 19:49:35,323 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-20 19:49:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:35,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 19:49:35,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:49:35,390 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-20 19:49:35,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:49:35,521 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-20 19:49:35,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120118777] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:49:35,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:49:35,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-09-20 19:49:35,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968376168] [2024-09-20 19:49:35,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:49:35,522 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-20 19:49:35,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:49:35,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-20 19:49:35,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-09-20 19:49:35,525 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-20 19:49:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:49:35,673 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-09-20 19:49:35,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 19:49:35,673 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-20 19:49:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:49:35,675 INFO L225 Difference]: With dead ends: 56 [2024-09-20 19:49:35,675 INFO L226 Difference]: Without dead ends: 52 [2024-09-20 19:49:35,675 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-20 19:49:35,676 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-09-20 19:49:35,676 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.1s Time] [2024-09-20 19:49:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-20 19:49:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-09-20 19:49:35,683 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-20 19:49:35,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2024-09-20 19:49:35,684 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 27 [2024-09-20 19:49:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:49:35,685 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2024-09-20 19:49:35,685 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-20 19:49:35,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2024-09-20 19:49:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-20 19:49:35,686 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:49:35,686 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-20 19:49:35,698 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 19:49:35,890 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-20 19:49:35,891 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:49:35,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:35,891 INFO L85 PathProgramCache]: Analyzing trace with hash -925704228, now seen corresponding path program 1 times [2024-09-20 19:49:35,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:49:35,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547001591] [2024-09-20 19:49:35,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:35,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:49:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:35,931 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:49:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:35,934 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:49:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:35,949 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:35,975 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:35,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-20 19:49:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:35,994 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 19:49:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:35,998 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-20 19:49:35,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:49:35,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547001591] [2024-09-20 19:49:35,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547001591] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:49:36,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38456947] [2024-09-20 19:49:36,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:36,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:49:36,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:49:36,002 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-20 19:49:36,003 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-20 19:49:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:36,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-20 19:49:36,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:49:36,104 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-20 19:49:36,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:49:36,334 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-20 19:49:36,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38456947] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:49:36,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:49:36,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-09-20 19:49:36,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192250170] [2024-09-20 19:49:36,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:49:36,335 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-20 19:49:36,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:49:36,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-20 19:49:36,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-09-20 19:49:36,336 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-20 19:49:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:49:36,531 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2024-09-20 19:49:36,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-20 19:49:36,532 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-20 19:49:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:49:36,533 INFO L225 Difference]: With dead ends: 112 [2024-09-20 19:49:36,533 INFO L226 Difference]: Without dead ends: 68 [2024-09-20 19:49:36,534 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-09-20 19:49:36,535 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.1s IncrementalHoareTripleChecker+Time [2024-09-20 19:49:36,535 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.1s Time] [2024-09-20 19:49:36,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-20 19:49:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-09-20 19:49:36,544 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-20 19:49:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2024-09-20 19:49:36,547 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2024-09-20 19:49:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:49:36,547 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2024-09-20 19:49:36,548 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-20 19:49:36,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2024-09-20 19:49:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-20 19:49:36,549 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:49:36,549 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-20 19:49:36,564 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 19:49:36,749 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-20 19:49:36,750 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:49:36,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:36,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1261961157, now seen corresponding path program 1 times [2024-09-20 19:49:36,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:49:36,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717273396] [2024-09-20 19:49:36,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:36,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:49:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:36,790 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:49:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:36,794 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:49:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:36,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:36,873 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:36,881 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:49:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:36,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 19:49:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:36,901 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-20 19:49:36,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:49:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717273396] [2024-09-20 19:49:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717273396] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:49:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712543506] [2024-09-20 19:49:36,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:36,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:49:36,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:49:36,905 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-20 19:49:36,906 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-20 19:49:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:36,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-20 19:49:36,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:49:37,009 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-20 19:49:37,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:49:37,252 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-20 19:49:37,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712543506] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:49:37,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:49:37,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 17 [2024-09-20 19:49:37,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901106538] [2024-09-20 19:49:37,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:49:37,253 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-20 19:49:37,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:49:37,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-20 19:49:37,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-09-20 19:49:37,255 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-20 19:49:37,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:49:37,477 INFO L93 Difference]: Finished difference Result 182 states and 328 transitions. [2024-09-20 19:49:37,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-20 19:49:37,477 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-20 19:49:37,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:49:37,479 INFO L225 Difference]: With dead ends: 182 [2024-09-20 19:49:37,480 INFO L226 Difference]: Without dead ends: 122 [2024-09-20 19:49:37,481 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-20 19:49:37,481 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 37 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 19:49:37,482 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-20 19:49:37,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-09-20 19:49:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2024-09-20 19:49:37,507 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-20 19:49:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 165 transitions. [2024-09-20 19:49:37,511 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 165 transitions. Word has length 40 [2024-09-20 19:49:37,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:49:37,511 INFO L474 AbstractCegarLoop]: Abstraction has 103 states and 165 transitions. [2024-09-20 19:49:37,511 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-20 19:49:37,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:37,512 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 165 transitions. [2024-09-20 19:49:37,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-20 19:49:37,519 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:49:37,519 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-20 19:49:37,531 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 19:49:37,719 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-20 19:49:37,720 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:49:37,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:37,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1624375296, now seen corresponding path program 1 times [2024-09-20 19:49:37,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:49:37,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889706530] [2024-09-20 19:49:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:37,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:49:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:37,765 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:49:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:37,767 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:49:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:37,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:37,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:37,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:37,862 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:49:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:37,864 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 19:49:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:37,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-20 19:49:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:37,876 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-20 19:49:37,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:49:37,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889706530] [2024-09-20 19:49:37,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889706530] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:49:37,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99103070] [2024-09-20 19:49:37,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:37,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:49:37,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:49:37,879 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-20 19:49:37,880 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-20 19:49:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:37,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-20 19:49:37,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:49:37,961 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-20 19:49:37,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:49:38,184 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-20 19:49:38,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99103070] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:49:38,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:49:38,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2024-09-20 19:49:38,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384427940] [2024-09-20 19:49:38,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:49:38,185 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-20 19:49:38,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:49:38,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-20 19:49:38,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-09-20 19:49:38,186 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-20 19:49:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:49:38,374 INFO L93 Difference]: Finished difference Result 265 states and 513 transitions. [2024-09-20 19:49:38,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-20 19:49:38,374 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-20 19:49:38,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:49:38,377 INFO L225 Difference]: With dead ends: 265 [2024-09-20 19:49:38,377 INFO L226 Difference]: Without dead ends: 168 [2024-09-20 19:49:38,378 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-09-20 19:49:38,379 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.1s IncrementalHoareTripleChecker+Time [2024-09-20 19:49:38,379 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.1s Time] [2024-09-20 19:49:38,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-09-20 19:49:38,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 142. [2024-09-20 19:49:38,403 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-20 19:49:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 244 transitions. [2024-09-20 19:49:38,404 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 244 transitions. Word has length 54 [2024-09-20 19:49:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:49:38,405 INFO L474 AbstractCegarLoop]: Abstraction has 142 states and 244 transitions. [2024-09-20 19:49:38,405 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-20 19:49:38,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 244 transitions. [2024-09-20 19:49:38,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-20 19:49:38,407 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:49:38,407 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-20 19:49:38,422 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-20 19:49:38,607 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-20 19:49:38,609 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:49:38,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1735862535, now seen corresponding path program 1 times [2024-09-20 19:49:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:49:38,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682895241] [2024-09-20 19:49:38,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:38,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:49:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:38,660 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:49:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:38,662 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:49:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:38,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:38,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:38,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:38,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:49:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:38,765 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 19:49:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:38,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-20 19:49:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:38,781 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-20 19:49:38,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:49:38,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682895241] [2024-09-20 19:49:38,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682895241] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:49:38,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20127078] [2024-09-20 19:49:38,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:38,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:49:38,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:49:38,784 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-20 19:49:38,784 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-20 19:49:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:38,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 19:49:38,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:49:38,872 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-20 19:49:38,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:49:39,022 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-20 19:49:39,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20127078] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:49:39,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:49:39,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2024-09-20 19:49:39,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158327422] [2024-09-20 19:49:39,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:49:39,023 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-20 19:49:39,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:49:39,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-20 19:49:39,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-09-20 19:49:39,024 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-20 19:49:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:49:39,260 INFO L93 Difference]: Finished difference Result 347 states and 700 transitions. [2024-09-20 19:49:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-20 19:49:39,261 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-20 19:49:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:49:39,264 INFO L225 Difference]: With dead ends: 347 [2024-09-20 19:49:39,264 INFO L226 Difference]: Without dead ends: 120 [2024-09-20 19:49:39,265 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-09-20 19:49:39,266 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 40 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 19:49:39,266 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-20 19:49:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-09-20 19:49:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2024-09-20 19:49:39,282 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-20 19:49:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 159 transitions. [2024-09-20 19:49:39,283 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 159 transitions. Word has length 55 [2024-09-20 19:49:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:49:39,283 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 159 transitions. [2024-09-20 19:49:39,283 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-20 19:49:39,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 159 transitions. [2024-09-20 19:49:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-20 19:49:39,285 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:49:39,285 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-20 19:49:39,300 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-20 19:49:39,489 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-20 19:49:39,490 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:49:39,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:39,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1987254780, now seen corresponding path program 2 times [2024-09-20 19:49:39,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:49:39,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120075903] [2024-09-20 19:49:39,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:39,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:49:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:39,532 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:49:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:39,534 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:49:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:39,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:39,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:39,627 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:39,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:49:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:39,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 19:49:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:39,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-20 19:49:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:39,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:39,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:49:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:39,699 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-20 19:49:39,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:49:39,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120075903] [2024-09-20 19:49:39,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120075903] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:49:39,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880765955] [2024-09-20 19:49:39,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 19:49:39,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:49:39,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:49:39,701 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-20 19:49:39,703 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-20 19:49:39,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 19:49:39,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:49:39,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-20 19:49:39,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:49:39,810 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-20 19:49:39,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:49:40,066 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-20 19:49:40,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880765955] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:49:40,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:49:40,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 9] total 22 [2024-09-20 19:49:40,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946698179] [2024-09-20 19:49:40,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:49:40,067 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-20 19:49:40,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:49:40,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-20 19:49:40,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-09-20 19:49:40,069 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-20 19:49:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:49:40,370 INFO L93 Difference]: Finished difference Result 192 states and 339 transitions. [2024-09-20 19:49:40,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-20 19:49:40,371 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-20 19:49:40,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:49:40,372 INFO L225 Difference]: With dead ends: 192 [2024-09-20 19:49:40,372 INFO L226 Difference]: Without dead ends: 89 [2024-09-20 19:49:40,373 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 148 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2024-09-20 19:49:40,373 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 63 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 19:49:40,373 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 274 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 19:49:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-09-20 19:49:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2024-09-20 19:49:40,380 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-20 19:49:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2024-09-20 19:49:40,381 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 69 [2024-09-20 19:49:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:49:40,381 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2024-09-20 19:49:40,382 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-20 19:49:40,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2024-09-20 19:49:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-20 19:49:40,383 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:49:40,383 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-20 19:49:40,395 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-20 19:49:40,583 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-20 19:49:40,584 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:49:40,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2144655573, now seen corresponding path program 1 times [2024-09-20 19:49:40,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:49:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638517487] [2024-09-20 19:49:40,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:49:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:40,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:49:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:40,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:49:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:40,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:40,798 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:40,854 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:40,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:49:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:40,888 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 19:49:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:40,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-20 19:49:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:40,927 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:40,934 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:49:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:40,952 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-20 19:49:40,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:49:40,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638517487] [2024-09-20 19:49:40,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638517487] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:49:40,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372611835] [2024-09-20 19:49:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:40,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:49:40,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:49:40,955 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-20 19:49:40,956 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-20 19:49:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:41,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-20 19:49:41,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:49:41,101 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-20 19:49:41,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:49:41,254 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-20 19:49:41,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372611835] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:49:41,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:49:41,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 21 [2024-09-20 19:49:41,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659141745] [2024-09-20 19:49:41,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:49:41,255 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-20 19:49:41,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:49:41,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-20 19:49:41,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-09-20 19:49:41,256 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-20 19:49:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:49:41,346 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2024-09-20 19:49:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-20 19:49:41,346 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-20 19:49:41,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:49:41,347 INFO L225 Difference]: With dead ends: 97 [2024-09-20 19:49:41,348 INFO L226 Difference]: Without dead ends: 93 [2024-09-20 19:49:41,348 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-09-20 19:49:41,348 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-20 19:49:41,348 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-20 19:49:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-20 19:49:41,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-09-20 19:49:41,363 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-20 19:49:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2024-09-20 19:49:41,364 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 68 [2024-09-20 19:49:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:49:41,364 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2024-09-20 19:49:41,365 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-20 19:49:41,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2024-09-20 19:49:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-20 19:49:41,365 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:49:41,366 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-20 19:49:41,379 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-20 19:49:41,566 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-20 19:49:41,567 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:49:41,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:41,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2028010288, now seen corresponding path program 1 times [2024-09-20 19:49:41,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:49:41,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820216390] [2024-09-20 19:49:41,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:41,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:49:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:41,604 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:49:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:41,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:49:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:41,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:41,633 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:41,648 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:41,660 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:49:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:41,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-20 19:49:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:41,679 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 19:49:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:41,681 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:49:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:41,682 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:49:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:41,684 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-20 19:49:41,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:49:41,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820216390] [2024-09-20 19:49:41,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820216390] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:49:41,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377839712] [2024-09-20 19:49:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:49:41,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:49:41,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:49:41,686 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-20 19:49:41,688 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-20 19:49:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:49:41,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-20 19:49:41,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:49:41,810 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-20 19:49:41,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:49:42,171 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-20 19:49:42,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377839712] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:49:42,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:49:42,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2024-09-20 19:49:42,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125009115] [2024-09-20 19:49:42,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:49:42,171 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-20 19:49:42,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:49:42,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-20 19:49:42,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-09-20 19:49:42,172 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-20 19:49:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:49:42,335 INFO L93 Difference]: Finished difference Result 162 states and 237 transitions. [2024-09-20 19:49:42,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-20 19:49:42,336 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-20 19:49:42,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:49:42,336 INFO L225 Difference]: With dead ends: 162 [2024-09-20 19:49:42,337 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 19:49:42,337 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-20 19:49:42,338 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-20 19:49:42,338 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-20 19:49:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 19:49:42,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 19:49:42,339 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-20 19:49:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 19:49:42,339 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2024-09-20 19:49:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:49:42,339 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 19:49:42,339 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-20 19:49:42,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:49:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 19:49:42,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 19:49:42,341 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 19:49:42,354 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-20 19:49:42,542 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-20 19:49:42,544 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:49:42,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 19:49:44,061 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 19:49:44,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 07:49:44 BoogieIcfgContainer [2024-09-20 19:49:44,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 19:49:44,077 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 19:49:44,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 19:49:44,078 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 19:49:44,078 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:49:33" (3/4) ... [2024-09-20 19:49:44,079 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 19:49:44,115 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 19:49:44,115 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 19:49:44,115 INFO L158 Benchmark]: Toolchain (without parser) took 10869.70ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 149.1MB in the beginning and 182.3MB in the end (delta: -33.3MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2024-09-20 19:49:44,115 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:49:44,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.19ms. Allocated memory is still 176.2MB. Free memory was 149.1MB in the beginning and 137.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-20 19:49:44,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.10ms. Allocated memory is still 176.2MB. Free memory was 137.6MB in the beginning and 136.9MB in the end (delta: 737.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:49:44,116 INFO L158 Benchmark]: Boogie Preprocessor took 38.04ms. Allocated memory is still 176.2MB. Free memory was 136.9MB in the beginning and 134.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:49:44,116 INFO L158 Benchmark]: RCFGBuilder took 237.13ms. Allocated memory is still 176.2MB. Free memory was 134.8MB in the beginning and 122.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 19:49:44,116 INFO L158 Benchmark]: TraceAbstraction took 10327.84ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 122.2MB in the beginning and 184.4MB in the end (delta: -62.2MB). Peak memory consumption was 158.1MB. Max. memory is 16.1GB. [2024-09-20 19:49:44,117 INFO L158 Benchmark]: Witness Printer took 37.76ms. Allocated memory is still 308.3MB. Free memory was 184.4MB in the beginning and 182.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:49:44,118 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.14ms. Allocated memory is still 176.2MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.19ms. Allocated memory is still 176.2MB. Free memory was 149.1MB in the beginning and 137.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.10ms. Allocated memory is still 176.2MB. Free memory was 137.6MB in the beginning and 136.9MB in the end (delta: 737.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.04ms. Allocated memory is still 176.2MB. Free memory was 136.9MB in the beginning and 134.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 237.13ms. Allocated memory is still 176.2MB. Free memory was 134.8MB in the beginning and 122.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10327.84ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 122.2MB in the beginning and 184.4MB in the end (delta: -62.2MB). Peak memory consumption was 158.1MB. Max. memory is 16.1GB. * Witness Printer took 37.76ms. Allocated memory is still 308.3MB. Free memory was 184.4MB in the beginning and 182.3MB in the end (delta: 2.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: 8.8s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 295 mSDsluCounter, 2557 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2223 mSDsCounter, 242 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2550 IncrementalHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 242 mSolverCounterUnsat, 334 mSDtfsCounter, 2550 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.3s 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 90 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s 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) && (\old(n) == 1)) || (\result == 0)) || (1 < \old(n))) && (((((\result == 1) && (\old(n) == 1)) || (\old(n) < 1)) || (3 < \old(n))) || ((\result == 1) && (2 == \old(n))))) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1. Ensures: (((((\result == 1) || (\old(n) < 1)) || (2 < \old(n))) && (((\result == 0) || (1 < \old(n))) || (\old(n) == 1))) && ((((3 == \old(n)) || (4 < \old(n))) || (\old(n) < 2)) || ((3 == \result) && (\old(n) == 4)))) RESULT: Ultimate proved your program to be correct! [2024-09-20 19:49:44,138 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