./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_fillercode_fillercodesize_ps-cn-50_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.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 6962e7bd484ae8ad671ef131faeb71f366744a10aa5efd4c2cd3298bbb34e994 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:50:43,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:50:43,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 03:50:43,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:50:43,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:50:43,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:50:43,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:50:43,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:50:43,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:50:43,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:50:43,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:50:43,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:50:43,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:50:43,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:50:43,187 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:50:43,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:50:43,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:50:43,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:50:43,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 03:50:43,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:50:43,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:50:43,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:50:43,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:50:43,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:50:43,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:50:43,190 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:50:43,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:50:43,191 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:50:43,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:50:43,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:50:43,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:50:43,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:50:43,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:50:43,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:50:43,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:50:43,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:50:43,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 03:50:43,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 03:50:43,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:50:43,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:50:43,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:50:43,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:50:43,195 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 -> 6962e7bd484ae8ad671ef131faeb71f366744a10aa5efd4c2cd3298bbb34e994 [2024-11-20 03:50:43,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:50:43,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:50:43,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:50:43,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:50:43,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:50:43,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.i [2024-11-20 03:50:44,881 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:50:45,066 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:50:45,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.i [2024-11-20 03:50:45,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85b33d959/84c275491bb548f5a756ea1066f33bd7/FLAGfe279052d [2024-11-20 03:50:45,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85b33d959/84c275491bb548f5a756ea1066f33bd7 [2024-11-20 03:50:45,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:50:45,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:50:45,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:50:45,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:50:45,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:50:45,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:50:45" (1/1) ... [2024-11-20 03:50:45,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9d89e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45, skipping insertion in model container [2024-11-20 03:50:45,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:50:45" (1/1) ... [2024-11-20 03:50:45,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:50:45,306 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_fillercode_fillercodesize_ps-cn-50_file-33.i[915,928] [2024-11-20 03:50:45,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:50:45,462 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:50:45,488 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_fillercode_fillercodesize_ps-cn-50_file-33.i[915,928] [2024-11-20 03:50:45,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:50:45,570 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:50:45,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45 WrapperNode [2024-11-20 03:50:45,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:50:45,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:50:45,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:50:45,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:50:45,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45" (1/1) ... [2024-11-20 03:50:45,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45" (1/1) ... [2024-11-20 03:50:45,628 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-11-20 03:50:45,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:50:45,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:50:45,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:50:45,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:50:45,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45" (1/1) ... [2024-11-20 03:50:45,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45" (1/1) ... [2024-11-20 03:50:45,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45" (1/1) ... [2024-11-20 03:50:45,681 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-20 03:50:45,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45" (1/1) ... [2024-11-20 03:50:45,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45" (1/1) ... [2024-11-20 03:50:45,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45" (1/1) ... [2024-11-20 03:50:45,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45" (1/1) ... [2024-11-20 03:50:45,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45" (1/1) ... [2024-11-20 03:50:45,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45" (1/1) ... [2024-11-20 03:50:45,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:50:45,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:50:45,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:50:45,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:50:45,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45" (1/1) ... [2024-11-20 03:50:45,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:50:45,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:50:45,738 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-20 03:50:45,752 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-20 03:50:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:50:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:50:45,790 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:50:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 03:50:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:50:45,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:50:45,856 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:50:45,857 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:50:46,331 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-20 03:50:46,331 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:50:46,348 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:50:46,354 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:50:46,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:50:46 BoogieIcfgContainer [2024-11-20 03:50:46,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:50:46,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:50:46,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:50:46,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:50:46,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:50:45" (1/3) ... [2024-11-20 03:50:46,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6497c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:50:46, skipping insertion in model container [2024-11-20 03:50:46,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:50:45" (2/3) ... [2024-11-20 03:50:46,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6497c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:50:46, skipping insertion in model container [2024-11-20 03:50:46,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:50:46" (3/3) ... [2024-11-20 03:50:46,364 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-33.i [2024-11-20 03:50:46,380 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:50:46,380 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:50:46,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:50:46,456 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;@4d39299d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:50:46,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:50:46,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 68 states have internal predecessors, (94), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 03:50:46,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-20 03:50:46,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:50:46,483 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:50:46,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:50:46,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:50:46,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1829805499, now seen corresponding path program 1 times [2024-11-20 03:50:46,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:50:46,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967041569] [2024-11-20 03:50:46,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:50:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:50:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:50:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 03:50:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 03:50:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 03:50:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 03:50:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 03:50:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 03:50:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:50:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:50:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:50:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:50:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:50:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:50:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:50:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:50:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:50:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:50:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:50:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:50:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:50:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:50:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:50:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:50:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:50:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:46,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:50:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 03:50:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 03:50:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:50:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 03:50:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:50:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 03:50:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 03:50:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 03:50:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-20 03:50:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-20 03:50:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-20 03:50:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-20 03:50:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-20 03:50:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-20 03:50:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-20 03:50:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-11-20 03:50:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-20 03:50:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-11-20 03:50:47,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:50:47,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967041569] [2024-11-20 03:50:47,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967041569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:50:47,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:50:47,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:50:47,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357167085] [2024-11-20 03:50:47,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:50:47,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:50:47,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:50:47,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:50:47,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:50:47,141 INFO L87 Difference]: Start difference. First operand has 112 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 68 states have internal predecessors, (94), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-20 03:50:47,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:50:47,169 INFO L93 Difference]: Finished difference Result 215 states and 388 transitions. [2024-11-20 03:50:47,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:50:47,171 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 257 [2024-11-20 03:50:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:50:47,177 INFO L225 Difference]: With dead ends: 215 [2024-11-20 03:50:47,177 INFO L226 Difference]: Without dead ends: 106 [2024-11-20 03:50:47,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-20 03:50:47,182 INFO L432 NwaCegarLoop]: 164 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, 164 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-20 03:50:47,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:50:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-20 03:50:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-20 03:50:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 03:50:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 164 transitions. [2024-11-20 03:50:47,219 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 164 transitions. Word has length 257 [2024-11-20 03:50:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:50:47,220 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 164 transitions. [2024-11-20 03:50:47,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-20 03:50:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 164 transitions. [2024-11-20 03:50:47,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-20 03:50:47,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:50:47,224 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:50:47,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 03:50:47,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:50:47,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:50:47,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1379091127, now seen corresponding path program 1 times [2024-11-20 03:50:47,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:50:47,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475229139] [2024-11-20 03:50:47,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:50:47,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:50:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:50:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 03:50:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 03:50:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 03:50:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 03:50:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 03:50:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 03:50:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:50:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:50:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:50:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:50:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:50:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:50:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:50:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:50:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:50:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:50:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:50:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:50:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:50:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:50:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:50:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:50:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:50:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:50:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 03:50:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 03:50:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:50:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 03:50:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:50:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 03:50:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 03:50:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 03:50:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-20 03:50:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-20 03:50:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-20 03:50:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-20 03:50:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-20 03:50:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-20 03:50:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-20 03:50:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-11-20 03:50:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-20 03:50:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-11-20 03:50:48,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:50:48,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475229139] [2024-11-20 03:50:48,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475229139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:50:48,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:50:48,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 03:50:48,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376306256] [2024-11-20 03:50:48,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:50:48,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 03:50:48,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:50:48,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 03:50:48,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 03:50:48,441 INFO L87 Difference]: Start difference. First operand 106 states and 164 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-11-20 03:50:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:50:48,714 INFO L93 Difference]: Finished difference Result 317 states and 494 transitions. [2024-11-20 03:50:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 03:50:48,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 257 [2024-11-20 03:50:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:50:48,718 INFO L225 Difference]: With dead ends: 317 [2024-11-20 03:50:48,718 INFO L226 Difference]: Without dead ends: 214 [2024-11-20 03:50:48,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:50:48,720 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 102 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 03:50:48,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 429 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 03:50:48,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-20 03:50:48,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 200. [2024-11-20 03:50:48,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 113 states have (on average 1.2831858407079646) internal successors, (145), 113 states have internal predecessors, (145), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-20 03:50:48,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 313 transitions. [2024-11-20 03:50:48,753 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 313 transitions. Word has length 257 [2024-11-20 03:50:48,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:50:48,754 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 313 transitions. [2024-11-20 03:50:48,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-11-20 03:50:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 313 transitions. [2024-11-20 03:50:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-20 03:50:48,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:50:48,757 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:50:48,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 03:50:48,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:50:48,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:50:48,758 INFO L85 PathProgramCache]: Analyzing trace with hash 215417878, now seen corresponding path program 1 times [2024-11-20 03:50:48,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:50:48,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6745035] [2024-11-20 03:50:48,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:50:48,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:50:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:50:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 03:50:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 03:50:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 03:50:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 03:50:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 03:50:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 03:50:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:50:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:50:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:50:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:50:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:50:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:50:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:50:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:50:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:50:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:50:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:50:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:50:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:50:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:50:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:50:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:50:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:50:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:50:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 03:50:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 03:50:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:50:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 03:50:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:50:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 03:50:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 03:50:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 03:50:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-20 03:50:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-20 03:50:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-20 03:50:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-20 03:50:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-20 03:50:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-20 03:50:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-20 03:50:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-11-20 03:50:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-20 03:50:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:50:49,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-11-20 03:50:49,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:50:49,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6745035] [2024-11-20 03:50:49,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6745035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:50:49,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:50:49,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 03:50:49,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651157407] [2024-11-20 03:50:49,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:50:49,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 03:50:49,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:50:49,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 03:50:49,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 03:50:49,206 INFO L87 Difference]: Start difference. First operand 200 states and 313 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-11-20 03:50:49,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:50:49,476 INFO L93 Difference]: Finished difference Result 326 states and 505 transitions. [2024-11-20 03:50:49,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 03:50:49,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 258 [2024-11-20 03:50:49,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:50:49,479 INFO L225 Difference]: With dead ends: 326 [2024-11-20 03:50:49,479 INFO L226 Difference]: Without dead ends: 210 [2024-11-20 03:50:49,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:50:49,481 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 99 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 03:50:49,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 434 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 03:50:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-20 03:50:49,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 201. [2024-11-20 03:50:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 114 states have internal predecessors, (145), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-20 03:50:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 313 transitions. [2024-11-20 03:50:49,521 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 313 transitions. Word has length 258 [2024-11-20 03:50:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:50:49,522 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 313 transitions. [2024-11-20 03:50:49,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-11-20 03:50:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 313 transitions. [2024-11-20 03:50:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-20 03:50:49,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:50:49,526 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:50:49,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 03:50:49,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:50:49,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:50:49,527 INFO L85 PathProgramCache]: Analyzing trace with hash 883880902, now seen corresponding path program 1 times [2024-11-20 03:50:49,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:50:49,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977991828] [2024-11-20 03:50:49,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:50:49,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:50:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat