./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-44.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 81a8d4a2e274ea03439b4780e4e81135b85cd8216b6685b3ff0798370a9049cf --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:49:44,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:49:44,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:49:44,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:49:44,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:49:44,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:49:44,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:49:44,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:49:44,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:49:44,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:49:44,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:49:44,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:49:44,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:49:44,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:49:44,369 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:49:44,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:49:44,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:49:44,370 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:49:44,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:49:44,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:49:44,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:49:44,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:49:44,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:49:44,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:49:44,374 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:49:44,374 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:49:44,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:49:44,375 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:49:44,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:49:44,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:49:44,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:49:44,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:49:44,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:49:44,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:49:44,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:49:44,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:49:44,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:49:44,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:49:44,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:49:44,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:49:44,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:49:44,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:49:44,379 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/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/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 -> 81a8d4a2e274ea03439b4780e4e81135b85cd8216b6685b3ff0798370a9049cf [2024-11-09 00:49:44,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:49:44,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:49:44,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:49:44,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:49:44,643 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:49:44,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-44.i [2024-11-09 00:49:46,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:49:46,421 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:49:46,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-44.i [2024-11-09 00:49:46,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae3ed3b5/b4fe6a860d354430a75a868becbac6af/FLAG316591e13 [2024-11-09 00:49:46,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae3ed3b5/b4fe6a860d354430a75a868becbac6af [2024-11-09 00:49:46,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:49:46,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:49:46,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:49:46,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:49:46,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:49:46,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:49:46" (1/1) ... [2024-11-09 00:49:46,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23287218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46, skipping insertion in model container [2024-11-09 00:49:46,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:49:46" (1/1) ... [2024-11-09 00:49:46,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:49:46,646 WARN L250 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_operatoramount_amount25_file-44.i[915,928] [2024-11-09 00:49:46,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:49:46,697 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:49:46,708 WARN L250 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_operatoramount_amount25_file-44.i[915,928] [2024-11-09 00:49:46,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:49:46,764 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:49:46,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46 WrapperNode [2024-11-09 00:49:46,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:49:46,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:49:46,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:49:46,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:49:46,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46" (1/1) ... [2024-11-09 00:49:46,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46" (1/1) ... [2024-11-09 00:49:46,819 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-11-09 00:49:46,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:49:46,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:49:46,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:49:46,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:49:46,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46" (1/1) ... [2024-11-09 00:49:46,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46" (1/1) ... [2024-11-09 00:49:46,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46" (1/1) ... [2024-11-09 00:49:46,858 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:49:46,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46" (1/1) ... [2024-11-09 00:49:46,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46" (1/1) ... [2024-11-09 00:49:46,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46" (1/1) ... [2024-11-09 00:49:46,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46" (1/1) ... [2024-11-09 00:49:46,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46" (1/1) ... [2024-11-09 00:49:46,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46" (1/1) ... [2024-11-09 00:49:46,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:49:46,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:49:46,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:49:46,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:49:46,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46" (1/1) ... [2024-11-09 00:49:46,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:49:46,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:49:46,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:49:46,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:49:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:49:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:49:46,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:49:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:49:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:49:46,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:49:47,035 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:49:47,037 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:49:47,406 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-09 00:49:47,407 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:49:47,421 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:49:47,425 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:49:47,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:49:47 BoogieIcfgContainer [2024-11-09 00:49:47,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:49:47,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:49:47,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:49:47,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:49:47,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:49:46" (1/3) ... [2024-11-09 00:49:47,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c14b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:49:47, skipping insertion in model container [2024-11-09 00:49:47,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:49:46" (2/3) ... [2024-11-09 00:49:47,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c14b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:49:47, skipping insertion in model container [2024-11-09 00:49:47,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:49:47" (3/3) ... [2024-11-09 00:49:47,437 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-44.i [2024-11-09 00:49:47,451 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:49:47,451 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:49:47,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:49:47,514 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;@3e8ae069, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:49:47,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:49:47,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:49:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 00:49:47,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:49:47,534 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:49:47,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:49:47,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:49:47,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1935860085, now seen corresponding path program 1 times [2024-11-09 00:49:47,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:49:47,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166273528] [2024-11-09 00:49:47,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:49:47,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:49:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:49:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:49:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:49:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:49:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:49:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:49:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:49:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:49:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:49:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:49:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:49:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:49:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:49:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:47,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:49:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:48,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:49:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:48,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:49:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:48,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:49:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:48,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 00:49:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:48,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 00:49:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:48,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 00:49:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:49:48,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:49:48,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166273528] [2024-11-09 00:49:48,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166273528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:49:48,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:49:48,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:49:48,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12295679] [2024-11-09 00:49:48,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:49:48,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:49:48,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:49:48,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:49:48,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:49:48,090 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 00:49:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:49:48,126 INFO L93 Difference]: Finished difference Result 119 states and 201 transitions. [2024-11-09 00:49:48,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:49:48,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2024-11-09 00:49:48,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:49:48,163 INFO L225 Difference]: With dead ends: 119 [2024-11-09 00:49:48,163 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 00:49:48,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-11-09 00:49:48,173 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:49:48,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:49:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 00:49:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 00:49:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:49:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-09 00:49:48,250 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 132 [2024-11-09 00:49:48,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:49:48,250 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-09 00:49:48,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-09 00:49:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-09 00:49:48,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 00:49:48,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:49:48,262 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:49:48,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:49:48,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:49:48,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:49:48,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1851365367, now seen corresponding path program 1 times [2024-11-09 00:49:48,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:49:48,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524642052] [2024-11-09 00:49:48,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:49:48,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:49:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:49:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:49:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:49:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:49:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:49:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:49:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:49:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:49:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:49:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:49:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:49:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:49:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:49:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:49:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:49:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:49:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:49:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 00:49:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 00:49:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 00:49:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:49:56,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:49:56,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524642052] [2024-11-09 00:49:56,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524642052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:49:56,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:49:56,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 00:49:56,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046738092] [2024-11-09 00:49:56,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:49:56,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:49:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:49:56,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:49:56,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:49:56,493 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:49:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:49:57,935 INFO L93 Difference]: Finished difference Result 182 states and 258 transitions. [2024-11-09 00:49:57,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 00:49:57,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-11-09 00:49:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:49:57,939 INFO L225 Difference]: With dead ends: 182 [2024-11-09 00:49:57,939 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 00:49:57,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:49:57,941 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 108 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:49:57,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 684 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 00:49:57,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 00:49:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 82. [2024-11-09 00:49:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 00:49:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-11-09 00:49:57,982 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 132 [2024-11-09 00:49:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:49:57,983 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-11-09 00:49:57,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:49:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-09 00:49:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 00:49:57,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:49:57,988 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:49:57,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:49:57,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:49:57,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:49:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2109530805, now seen corresponding path program 1 times [2024-11-09 00:49:57,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:49:57,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523750793] [2024-11-09 00:49:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:49:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:49:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:49:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:49:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:49:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:49:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:49:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:49:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:49:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:49:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:49:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:49:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:49:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:49:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:49:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:49:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:49:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:49:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:49:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 00:49:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 00:49:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 00:49:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:49:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:49:58,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:49:58,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523750793] [2024-11-09 00:49:58,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523750793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:49:58,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:49:58,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 00:49:58,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114082788] [2024-11-09 00:49:58,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:49:58,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:49:58,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:49:58,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:49:58,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:49:58,825 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:49:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:49:59,262 INFO L93 Difference]: Finished difference Result 200 states and 280 transitions. [2024-11-09 00:49:59,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 00:49:59,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-11-09 00:49:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:49:59,265 INFO L225 Difference]: With dead ends: 200 [2024-11-09 00:49:59,266 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 00:49:59,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:49:59,268 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 114 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:49:59,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 669 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:49:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 00:49:59,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2024-11-09 00:49:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 00:49:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2024-11-09 00:49:59,292 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 132 [2024-11-09 00:49:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:49:59,294 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2024-11-09 00:49:59,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:49:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2024-11-09 00:49:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 00:49:59,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:49:59,301 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:49:59,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:49:59,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:49:59,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:49:59,302 INFO L85 PathProgramCache]: Analyzing trace with hash 406852919, now seen corresponding path program 1 times [2024-11-09 00:49:59,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:49:59,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069310745] [2024-11-09 00:49:59,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:49:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:49:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:51:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:51:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:51:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:51:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:51:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:51:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:51:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:51:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:51:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:51:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:51:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:51:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:51:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:51:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:51:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:51:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:51:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:51:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 00:51:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 00:51:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 00:51:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:51:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 00:51:15,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:51:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069310745] [2024-11-09 00:51:15,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069310745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:51:15,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:51:15,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 00:51:15,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651846930] [2024-11-09 00:51:15,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:51:15,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 00:51:15,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:51:15,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 00:51:15,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:51:15,277 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:51:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:51:16,300 INFO L93 Difference]: Finished difference Result 175 states and 243 transitions. [2024-11-09 00:51:16,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 00:51:16,301 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 133 [2024-11-09 00:51:16,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:51:16,303 INFO L225 Difference]: With dead ends: 175 [2024-11-09 00:51:16,303 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 00:51:16,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:51:16,305 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 96 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 00:51:16,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 342 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 00:51:16,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 00:51:16,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 80. [2024-11-09 00:51:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 00:51:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2024-11-09 00:51:16,329 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 133 [2024-11-09 00:51:16,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:51:16,330 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2024-11-09 00:51:16,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-09 00:51:16,330 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2024-11-09 00:51:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 00:51:16,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:51:16,333 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:51:16,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:51:16,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:51:16,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:51:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash 13825909, now seen corresponding path program 1 times [2024-11-09 00:51:16,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:51:16,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632657306] [2024-11-09 00:51:16,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:51:16,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:51:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat