./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --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 cc7a9a2f6e7b1ee77bf3f8df4593a14d130ce94528ae7e9cb4543cec3e179328 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:04:30,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:04:30,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:04:30,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:04:30,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:04:30,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:04:30,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:04:30,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:04:30,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:04:30,461 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:04:30,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:04:30,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:04:30,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:04:30,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:04:30,465 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:04:30,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:04:30,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:04:30,466 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:04:30,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:04:30,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:04:30,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:04:30,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:04:30,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:04:30,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:04:30,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:04:30,471 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:04:30,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:04:30,471 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:04:30,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:04:30,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:04:30,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:04:30,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:04:30,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:04:30,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:04:30,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:04:30,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:04:30,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:04:30,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:04:30,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:04:30,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:04:30,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:04:30,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:04:30,475 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/ultimate-clean/releaseScripts/default/UAutomizer-linux/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/ultimate-clean/releaseScripts/default/UAutomizer-linux 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 -> cc7a9a2f6e7b1ee77bf3f8df4593a14d130ce94528ae7e9cb4543cec3e179328 [2024-10-11 14:04:30,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:04:30,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:04:30,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:04:30,712 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:04:30,713 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:04:30,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i [2024-10-11 14:04:31,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:04:32,162 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:04:32,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i [2024-10-11 14:04:32,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/db4ea1dc2/2f3d97adb0a0451da2926eab8588b02a/FLAG6c97960ac [2024-10-11 14:04:32,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/db4ea1dc2/2f3d97adb0a0451da2926eab8588b02a [2024-10-11 14:04:32,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:04:32,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:04:32,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:04:32,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:04:32,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:04:32,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:04:32" (1/1) ... [2024-10-11 14:04:32,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517957b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32, skipping insertion in model container [2024-10-11 14:04:32,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:04:32" (1/1) ... [2024-10-11 14:04:32,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:04:32,391 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i[917,930] [2024-10-11 14:04:32,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:04:32,477 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:04:32,494 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i[917,930] [2024-10-11 14:04:32,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:04:32,555 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:04:32,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32 WrapperNode [2024-10-11 14:04:32,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:04:32,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:04:32,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:04:32,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:04:32,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32" (1/1) ... [2024-10-11 14:04:32,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32" (1/1) ... [2024-10-11 14:04:32,601 INFO L138 Inliner]: procedures = 26, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2024-10-11 14:04:32,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:04:32,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:04:32,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:04:32,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:04:32,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32" (1/1) ... [2024-10-11 14:04:32,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32" (1/1) ... [2024-10-11 14:04:32,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32" (1/1) ... [2024-10-11 14:04:32,640 INFO L175 MemorySlicer]: Split 107 memory accesses to 2 slices as follows [2, 105]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 15 writes are split as follows [0, 15]. [2024-10-11 14:04:32,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32" (1/1) ... [2024-10-11 14:04:32,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32" (1/1) ... [2024-10-11 14:04:32,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32" (1/1) ... [2024-10-11 14:04:32,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32" (1/1) ... [2024-10-11 14:04:32,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32" (1/1) ... [2024-10-11 14:04:32,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32" (1/1) ... [2024-10-11 14:04:32,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:04:32,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:04:32,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:04:32,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:04:32,676 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32" (1/1) ... [2024-10-11 14:04:32,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:04:32,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:04:32,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:04:32,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:04:32,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:04:32,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:04:32,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:04:32,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:04:32,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:04:32,792 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:04:32,792 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:04:32,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:04:32,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:04:32,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:04:32,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:04:32,931 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:04:32,933 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:04:33,336 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-10-11 14:04:33,336 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:04:33,376 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:04:33,380 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:04:33,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:04:33 BoogieIcfgContainer [2024-10-11 14:04:33,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:04:33,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:04:33,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:04:33,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:04:33,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:04:32" (1/3) ... [2024-10-11 14:04:33,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b59df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:04:33, skipping insertion in model container [2024-10-11 14:04:33,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:32" (2/3) ... [2024-10-11 14:04:33,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b59df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:04:33, skipping insertion in model container [2024-10-11 14:04:33,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:04:33" (3/3) ... [2024-10-11 14:04:33,390 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-89.i [2024-10-11 14:04:33,414 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:04:33,416 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:04:33,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:04:33,478 INFO L333 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=LoopHeads, 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;@413c59fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:04:33,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:04:33,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 14:04:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:33,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:33,491 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:33,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:33,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:33,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1381092916, now seen corresponding path program 1 times [2024-10-11 14:04:33,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:33,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946958475] [2024-10-11 14:04:33,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:33,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 14:04:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:33,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946958475] [2024-10-11 14:04:33,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946958475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:33,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:33,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:04:33,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442995901] [2024-10-11 14:04:33,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:33,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:04:33,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:33,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:04:33,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:04:33,875 INFO L87 Difference]: Start difference. First operand has 95 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 14:04:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:33,909 INFO L93 Difference]: Finished difference Result 187 states and 297 transitions. [2024-10-11 14:04:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:04:33,911 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-10-11 14:04:33,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:33,918 INFO L225 Difference]: With dead ends: 187 [2024-10-11 14:04:33,919 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 14:04:33,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:04:33,923 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:33,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 14:04:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 14:04:33,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 14:04:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2024-10-11 14:04:33,960 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 104 [2024-10-11 14:04:33,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:33,962 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2024-10-11 14:04:33,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 14:04:33,963 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2024-10-11 14:04:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:33,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:33,965 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:33,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:04:33,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:33,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:33,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1783485146, now seen corresponding path program 1 times [2024-10-11 14:04:33,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:33,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599834193] [2024-10-11 14:04:33,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:33,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 14:04:34,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:34,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599834193] [2024-10-11 14:04:34,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599834193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:34,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:34,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:34,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434900034] [2024-10-11 14:04:34,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:34,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:34,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:34,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:34,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:34,301 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:04:34,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:34,349 INFO L93 Difference]: Finished difference Result 188 states and 275 transitions. [2024-10-11 14:04:34,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:34,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-11 14:04:34,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:34,355 INFO L225 Difference]: With dead ends: 188 [2024-10-11 14:04:34,355 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 14:04:34,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:34,356 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:34,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 380 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:34,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 14:04:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-11 14:04:34,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 14:04:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 138 transitions. [2024-10-11 14:04:34,365 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 138 transitions. Word has length 104 [2024-10-11 14:04:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:34,366 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 138 transitions. [2024-10-11 14:04:34,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:04:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 138 transitions. [2024-10-11 14:04:34,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:34,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:34,369 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:34,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:04:34,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:34,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:34,370 INFO L85 PathProgramCache]: Analyzing trace with hash 974138520, now seen corresponding path program 1 times [2024-10-11 14:04:34,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:34,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066881006] [2024-10-11 14:04:34,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:34,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 14:04:34,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:34,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066881006] [2024-10-11 14:04:34,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066881006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:34,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:34,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:34,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119957148] [2024-10-11 14:04:34,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:34,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:34,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:34,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:34,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:34,586 INFO L87 Difference]: Start difference. First operand 95 states and 138 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:04:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:34,633 INFO L93 Difference]: Finished difference Result 192 states and 279 transitions. [2024-10-11 14:04:34,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:34,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-11 14:04:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:34,635 INFO L225 Difference]: With dead ends: 192 [2024-10-11 14:04:34,635 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 14:04:34,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:34,636 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:34,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 381 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 14:04:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-11 14:04:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 14:04:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-10-11 14:04:34,646 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 104 [2024-10-11 14:04:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:34,646 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-10-11 14:04:34,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:04:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-10-11 14:04:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:34,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:34,649 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:34,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:04:34,649 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:34,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:34,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1031396822, now seen corresponding path program 1 times [2024-10-11 14:04:34,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:34,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823371529] [2024-10-11 14:04:34,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:34,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 14:04:34,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:34,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823371529] [2024-10-11 14:04:34,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823371529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:34,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:34,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:34,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425124229] [2024-10-11 14:04:34,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:34,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:34,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:34,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:34,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:34,822 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:04:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:34,854 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2024-10-11 14:04:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:34,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-11 14:04:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:34,859 INFO L225 Difference]: With dead ends: 196 [2024-10-11 14:04:34,859 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 14:04:34,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:34,861 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:34,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:34,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 14:04:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-11 14:04:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 14:04:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 142 transitions. [2024-10-11 14:04:34,871 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 142 transitions. Word has length 104 [2024-10-11 14:04:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:34,872 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 142 transitions. [2024-10-11 14:04:34,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:04:34,872 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 142 transitions. [2024-10-11 14:04:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:34,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:34,874 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:34,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:04:34,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:34,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:34,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1031456404, now seen corresponding path program 1 times [2024-10-11 14:04:34,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:34,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823045666] [2024-10-11 14:04:34,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:34,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:36,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:36,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:36,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:36,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:36,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:36,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:36,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:36,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:36,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:36,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:36,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:36,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:36,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 14:04:36,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:36,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823045666] [2024-10-11 14:04:36,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823045666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:36,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:36,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:04:36,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571359765] [2024-10-11 14:04:36,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:36,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:04:36,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:36,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:04:36,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:04:36,628 INFO L87 Difference]: Start difference. First operand 99 states and 142 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:04:37,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:37,253 INFO L93 Difference]: Finished difference Result 260 states and 373 transitions. [2024-10-11 14:04:37,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:04:37,255 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-11 14:04:37,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:37,256 INFO L225 Difference]: With dead ends: 260 [2024-10-11 14:04:37,257 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 14:04:37,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:04:37,258 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 339 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:37,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 531 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:04:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 14:04:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 110. [2024-10-11 14:04:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 95 states have internal predecessors, (132), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 14:04:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-10-11 14:04:37,277 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 104 [2024-10-11 14:04:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:37,277 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-10-11 14:04:37,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:04:37,278 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-10-11 14:04:37,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:37,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:37,279 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:37,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:04:37,279 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:37,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:37,279 INFO L85 PathProgramCache]: Analyzing trace with hash -248407274, now seen corresponding path program 1 times [2024-10-11 14:04:37,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:37,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190630044] [2024-10-11 14:04:37,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:37,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 14:04:38,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:38,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190630044] [2024-10-11 14:04:38,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190630044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:38,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:38,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:04:38,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787350200] [2024-10-11 14:04:38,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:38,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:04:38,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:38,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:04:38,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:04:38,746 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 12 states, 10 states have (on average 4.2) internal successors, (42), 12 states have internal predecessors, (42), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-11 14:04:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:39,304 INFO L93 Difference]: Finished difference Result 284 states and 405 transitions. [2024-10-11 14:04:39,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:04:39,305 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.2) internal successors, (42), 12 states have internal predecessors, (42), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 5 states have call successors, (13) Word has length 104 [2024-10-11 14:04:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:39,306 INFO L225 Difference]: With dead ends: 284 [2024-10-11 14:04:39,306 INFO L226 Difference]: Without dead ends: 175 [2024-10-11 14:04:39,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:04:39,307 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 443 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:39,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 444 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:04:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-11 14:04:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2024-10-11 14:04:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 152 states have internal predecessors, (209), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 14:04:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 241 transitions. [2024-10-11 14:04:39,336 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 241 transitions. Word has length 104 [2024-10-11 14:04:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:39,337 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 241 transitions. [2024-10-11 14:04:39,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.2) internal successors, (42), 12 states have internal predecessors, (42), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-11 14:04:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 241 transitions. [2024-10-11 14:04:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:39,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:39,338 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:39,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:04:39,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:39,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:39,338 INFO L85 PathProgramCache]: Analyzing trace with hash 903292637, now seen corresponding path program 1 times [2024-10-11 14:04:39,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:39,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277658872] [2024-10-11 14:04:39,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:39,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:42,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:42,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:42,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:42,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:42,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:42,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:42,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:42,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:42,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:42,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:42,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:42,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:42,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 14:04:42,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:42,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277658872] [2024-10-11 14:04:42,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277658872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:42,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:42,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:04:42,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84853011] [2024-10-11 14:04:42,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:42,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:04:42,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:42,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:04:42,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:04:42,201 INFO L87 Difference]: Start difference. First operand 170 states and 241 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 14:04:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:43,686 INFO L93 Difference]: Finished difference Result 490 states and 697 transitions. [2024-10-11 14:04:43,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:04:43,686 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 104 [2024-10-11 14:04:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:43,689 INFO L225 Difference]: With dead ends: 490 [2024-10-11 14:04:43,689 INFO L226 Difference]: Without dead ends: 321 [2024-10-11 14:04:43,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:04:43,690 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 185 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:43,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 476 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 14:04:43,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-11 14:04:43,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 219. [2024-10-11 14:04:43,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 186 states have (on average 1.3602150537634408) internal successors, (253), 187 states have internal predecessors, (253), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 14:04:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 311 transitions. [2024-10-11 14:04:43,711 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 311 transitions. Word has length 104 [2024-10-11 14:04:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:43,712 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 311 transitions. [2024-10-11 14:04:43,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 14:04:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 311 transitions. [2024-10-11 14:04:43,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:43,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:43,713 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:43,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:04:43,713 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:43,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:43,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1454158230, now seen corresponding path program 1 times [2024-10-11 14:04:43,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:43,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660757276] [2024-10-11 14:04:43,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:43,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 14:04:44,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:44,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660757276] [2024-10-11 14:04:44,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660757276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:44,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:44,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:04:44,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811671659] [2024-10-11 14:04:44,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:44,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:04:44,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:44,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:04:44,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:04:44,989 INFO L87 Difference]: Start difference. First operand 219 states and 311 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 14:04:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:45,451 INFO L93 Difference]: Finished difference Result 462 states and 652 transitions. [2024-10-11 14:04:45,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:04:45,451 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 104 [2024-10-11 14:04:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:45,453 INFO L225 Difference]: With dead ends: 462 [2024-10-11 14:04:45,453 INFO L226 Difference]: Without dead ends: 293 [2024-10-11 14:04:45,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:04:45,454 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 529 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:45,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 386 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:04:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-11 14:04:45,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 236. [2024-10-11 14:04:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 202 states have (on average 1.3712871287128714) internal successors, (277), 203 states have internal predecessors, (277), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 14:04:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 335 transitions. [2024-10-11 14:04:45,484 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 335 transitions. Word has length 104 [2024-10-11 14:04:45,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:45,484 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 335 transitions. [2024-10-11 14:04:45,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 14:04:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 335 transitions. [2024-10-11 14:04:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:45,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:45,486 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:45,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:04:45,486 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:45,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:45,487 INFO L85 PathProgramCache]: Analyzing trace with hash 174294552, now seen corresponding path program 1 times [2024-10-11 14:04:45,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:45,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837620847] [2024-10-11 14:04:45,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:45,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 14:04:46,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:46,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837620847] [2024-10-11 14:04:46,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837620847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:46,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:46,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:04:46,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403098965] [2024-10-11 14:04:46,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:46,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:04:46,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:46,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:04:46,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:04:46,039 INFO L87 Difference]: Start difference. First operand 236 states and 335 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:04:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:46,658 INFO L93 Difference]: Finished difference Result 469 states and 666 transitions. [2024-10-11 14:04:46,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:04:46,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-11 14:04:46,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:46,660 INFO L225 Difference]: With dead ends: 469 [2024-10-11 14:04:46,660 INFO L226 Difference]: Without dead ends: 287 [2024-10-11 14:04:46,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:04:46,661 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 180 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:46,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1040 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:04:46,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-11 14:04:46,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 239. [2024-10-11 14:04:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 205 states have (on average 1.3707317073170733) internal successors, (281), 206 states have internal predecessors, (281), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 14:04:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 339 transitions. [2024-10-11 14:04:46,684 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 339 transitions. Word has length 104 [2024-10-11 14:04:46,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:46,684 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 339 transitions. [2024-10-11 14:04:46,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:04:46,685 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 339 transitions. [2024-10-11 14:04:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:46,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:46,687 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:46,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:04:46,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:46,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:46,687 INFO L85 PathProgramCache]: Analyzing trace with hash 99088159, now seen corresponding path program 1 times [2024-10-11 14:04:46,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:46,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587377052] [2024-10-11 14:04:46,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:46,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:47,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:47,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:47,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:47,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:47,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:47,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:47,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:47,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:47,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:47,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:47,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:47,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:47,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 14:04:47,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:47,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587377052] [2024-10-11 14:04:47,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587377052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:47,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:47,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:04:47,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998910600] [2024-10-11 14:04:47,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:47,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:04:47,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:47,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:04:47,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:04:47,820 INFO L87 Difference]: Start difference. First operand 239 states and 339 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 14:04:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:48,262 INFO L93 Difference]: Finished difference Result 497 states and 705 transitions. [2024-10-11 14:04:48,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:04:48,263 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 104 [2024-10-11 14:04:48,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:48,265 INFO L225 Difference]: With dead ends: 497 [2024-10-11 14:04:48,266 INFO L226 Difference]: Without dead ends: 312 [2024-10-11 14:04:48,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:04:48,266 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 315 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:48,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 380 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:04:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-11 14:04:48,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 244. [2024-10-11 14:04:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 210 states have (on average 1.3761904761904762) internal successors, (289), 211 states have internal predecessors, (289), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 14:04:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 347 transitions. [2024-10-11 14:04:48,303 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 347 transitions. Word has length 104 [2024-10-11 14:04:48,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:48,303 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 347 transitions. [2024-10-11 14:04:48,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 14:04:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 347 transitions. [2024-10-11 14:04:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:48,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:48,305 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:48,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:04:48,305 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:48,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:48,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1180775519, now seen corresponding path program 1 times [2024-10-11 14:04:48,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:48,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404718603] [2024-10-11 14:04:48,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:48,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:48,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:48,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:48,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:48,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:48,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:48,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:48,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:48,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:48,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:48,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:48,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:48,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:48,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 14:04:48,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:48,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404718603] [2024-10-11 14:04:48,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404718603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:48,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:48,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:04:48,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752950670] [2024-10-11 14:04:48,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:48,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:04:48,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:48,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:04:48,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:04:48,732 INFO L87 Difference]: Start difference. First operand 244 states and 347 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:04:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:49,031 INFO L93 Difference]: Finished difference Result 491 states and 700 transitions. [2024-10-11 14:04:49,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:04:49,032 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-11 14:04:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:49,033 INFO L225 Difference]: With dead ends: 491 [2024-10-11 14:04:49,033 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 14:04:49,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:04:49,034 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 297 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:49,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 638 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:04:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 14:04:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 240. [2024-10-11 14:04:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 206 states have (on average 1.3689320388349515) internal successors, (282), 207 states have internal predecessors, (282), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 14:04:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 340 transitions. [2024-10-11 14:04:49,055 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 340 transitions. Word has length 104 [2024-10-11 14:04:49,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:49,056 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 340 transitions. [2024-10-11 14:04:49,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:04:49,056 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 340 transitions. [2024-10-11 14:04:49,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:49,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:49,057 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:49,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:04:49,057 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:49,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:49,057 INFO L85 PathProgramCache]: Analyzing trace with hash -29075608, now seen corresponding path program 1 times [2024-10-11 14:04:49,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:49,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024517655] [2024-10-11 14:04:49,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:49,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:49,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:49,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:49,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:49,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:49,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:49,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:49,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:49,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:49,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:49,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:49,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:49,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:49,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 14:04:49,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:49,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024517655] [2024-10-11 14:04:49,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024517655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:49,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:49,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:04:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166798008] [2024-10-11 14:04:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:49,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:04:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:49,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:04:49,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:04:49,928 INFO L87 Difference]: Start difference. First operand 240 states and 340 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 14:04:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:50,420 INFO L93 Difference]: Finished difference Result 503 states and 711 transitions. [2024-10-11 14:04:50,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:04:50,420 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 104 [2024-10-11 14:04:50,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:50,422 INFO L225 Difference]: With dead ends: 503 [2024-10-11 14:04:50,423 INFO L226 Difference]: Without dead ends: 317 [2024-10-11 14:04:50,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:04:50,423 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 663 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:50,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 436 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:04:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-11 14:04:50,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 255. [2024-10-11 14:04:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 221 states have (on average 1.3846153846153846) internal successors, (306), 222 states have internal predecessors, (306), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 14:04:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 364 transitions. [2024-10-11 14:04:50,444 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 364 transitions. Word has length 104 [2024-10-11 14:04:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:50,444 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 364 transitions. [2024-10-11 14:04:50,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 14:04:50,446 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 364 transitions. [2024-10-11 14:04:50,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:50,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:50,446 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:50,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:04:50,447 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:50,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:50,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1308939286, now seen corresponding path program 1 times [2024-10-11 14:04:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:50,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924978398] [2024-10-11 14:04:50,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 14:04:50,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:50,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924978398] [2024-10-11 14:04:50,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924978398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:50,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:50,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:04:50,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12380652] [2024-10-11 14:04:50,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:50,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:04:50,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:50,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:04:50,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:04:50,860 INFO L87 Difference]: Start difference. First operand 255 states and 364 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:04:51,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:51,240 INFO L93 Difference]: Finished difference Result 505 states and 719 transitions. [2024-10-11 14:04:51,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:04:51,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-10-11 14:04:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:51,243 INFO L225 Difference]: With dead ends: 505 [2024-10-11 14:04:51,244 INFO L226 Difference]: Without dead ends: 304 [2024-10-11 14:04:51,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:04:51,245 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 244 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:51,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 988 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:04:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-11 14:04:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 257. [2024-10-11 14:04:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 223 states have (on average 1.3811659192825112) internal successors, (308), 224 states have internal predecessors, (308), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 14:04:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 366 transitions. [2024-10-11 14:04:51,265 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 366 transitions. Word has length 104 [2024-10-11 14:04:51,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:51,266 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 366 transitions. [2024-10-11 14:04:51,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:04:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 366 transitions. [2024-10-11 14:04:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:51,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:51,267 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:51,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 14:04:51,267 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:51,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:51,267 INFO L85 PathProgramCache]: Analyzing trace with hash -323613667, now seen corresponding path program 1 times [2024-10-11 14:04:51,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:51,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100338679] [2024-10-11 14:04:51,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:51,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat