./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_loopvsstraightlinecode_50-1loop_file-9.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 ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:38:06,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:38:06,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:38:06,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:38:06,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:38:06,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:38:06,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:38:06,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:38:06,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:38:06,321 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:38:06,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:38:06,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:38:06,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:38:06,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:38:06,322 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:38:06,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:38:06,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:38:06,323 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:38:06,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:38:06,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:38:06,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:38:06,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:38:06,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:38:06,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:38:06,323 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:38:06,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:38:06,323 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:38:06,323 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:38:06,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:38:06,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:38:06,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:38:06,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:38:06,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:38:06,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:38:06,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:38:06,324 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:38:06,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:38:06,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:38:06,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:38:06,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:38:06,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:38:06,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:38:06,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:38:06,325 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d [2025-03-03 23:38:06,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:38:06,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:38:06,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:38:06,551 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:38:06,551 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:38:06,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2025-03-03 23:38:07,650 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0066ded6c/a54d7294d538448797082a269d3034cc/FLAGa6795fbc2 [2025-03-03 23:38:07,898 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:38:07,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2025-03-03 23:38:07,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0066ded6c/a54d7294d538448797082a269d3034cc/FLAGa6795fbc2 [2025-03-03 23:38:08,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0066ded6c/a54d7294d538448797082a269d3034cc [2025-03-03 23:38:08,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:38:08,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:38:08,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:38:08,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:38:08,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:38:08,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:38:08" (1/1) ... [2025-03-03 23:38:08,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ddb531b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08, skipping insertion in model container [2025-03-03 23:38:08,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:38:08" (1/1) ... [2025-03-03 23:38:08,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:38:08,352 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_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2025-03-03 23:38:08,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:38:08,408 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:38:08,415 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_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2025-03-03 23:38:08,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:38:08,462 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:38:08,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08 WrapperNode [2025-03-03 23:38:08,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:38:08,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:38:08,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:38:08,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:38:08,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08" (1/1) ... [2025-03-03 23:38:08,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08" (1/1) ... [2025-03-03 23:38:08,507 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2025-03-03 23:38:08,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:38:08,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:38:08,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:38:08,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:38:08,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08" (1/1) ... [2025-03-03 23:38:08,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08" (1/1) ... [2025-03-03 23:38:08,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08" (1/1) ... [2025-03-03 23:38:08,526 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]. [2025-03-03 23:38:08,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08" (1/1) ... [2025-03-03 23:38:08,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08" (1/1) ... [2025-03-03 23:38:08,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08" (1/1) ... [2025-03-03 23:38:08,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08" (1/1) ... [2025-03-03 23:38:08,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08" (1/1) ... [2025-03-03 23:38:08,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08" (1/1) ... [2025-03-03 23:38:08,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:38:08,540 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:38:08,540 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:38:08,540 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:38:08,541 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08" (1/1) ... [2025-03-03 23:38:08,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:38:08,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:38:08,572 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) [2025-03-03 23:38:08,576 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 [2025-03-03 23:38:08,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:38:08,591 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:38:08,591 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:38:08,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:38:08,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:38:08,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:38:08,647 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:38:08,648 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:38:08,872 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~bitwise15#1;havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-03 23:38:08,892 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-03 23:38:08,892 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:38:08,907 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:38:08,908 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:38:08,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:38:08 BoogieIcfgContainer [2025-03-03 23:38:08,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:38:08,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:38:08,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:38:08,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:38:08,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:38:08" (1/3) ... [2025-03-03 23:38:08,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d883e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:38:08, skipping insertion in model container [2025-03-03 23:38:08,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:38:08" (2/3) ... [2025-03-03 23:38:08,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d883e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:38:08, skipping insertion in model container [2025-03-03 23:38:08,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:38:08" (3/3) ... [2025-03-03 23:38:08,918 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-9.i [2025-03-03 23:38:08,927 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:38:08,928 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-9.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:38:08,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:38:08,967 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;@1a61e5c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:38:08,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:38:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 23:38:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 23:38:08,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:38:08,977 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:38:08,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:38:08,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:38:08,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1726001061, now seen corresponding path program 1 times [2025-03-03 23:38:08,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:38:08,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759307364] [2025-03-03 23:38:08,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:08,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:38:09,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 23:38:09,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 23:38:09,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:09,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-03 23:38:09,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:38:09,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759307364] [2025-03-03 23:38:09,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759307364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:38:09,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421252902] [2025-03-03 23:38:09,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:09,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:38:09,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:38:09,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:38:09,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:38:09,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 23:38:09,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 23:38:09,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:09,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:09,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:38:09,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:38:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-03 23:38:09,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:38:09,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421252902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:38:09,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:38:09,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:38:09,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911565047] [2025-03-03 23:38:09,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:38:09,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:38:09,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:38:09,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:38:09,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:38:09,309 INFO L87 Difference]: Start difference. First operand has 73 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 23:38:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:38:09,336 INFO L93 Difference]: Finished difference Result 143 states and 226 transitions. [2025-03-03 23:38:09,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:38:09,338 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2025-03-03 23:38:09,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:38:09,343 INFO L225 Difference]: With dead ends: 143 [2025-03-03 23:38:09,343 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 23:38:09,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:38:09,347 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:38:09,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:38:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 23:38:09,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 23:38:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 23:38:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2025-03-03 23:38:09,379 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 108 [2025-03-03 23:38:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:38:09,380 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2025-03-03 23:38:09,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 23:38:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2025-03-03 23:38:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 23:38:09,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:38:09,385 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:38:09,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:38:09,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:38:09,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:38:09,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:38:09,591 INFO L85 PathProgramCache]: Analyzing trace with hash -988421758, now seen corresponding path program 1 times [2025-03-03 23:38:09,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:38:09,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593782801] [2025-03-03 23:38:09,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:09,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:38:09,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 23:38:09,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 23:38:09,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:09,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 23:38:09,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:38:09,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593782801] [2025-03-03 23:38:09,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593782801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:38:09,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:38:09,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:38:09,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722360827] [2025-03-03 23:38:09,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:38:09,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:38:09,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:38:09,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:38:09,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:38:09,824 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:38:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:38:09,851 INFO L93 Difference]: Finished difference Result 138 states and 203 transitions. [2025-03-03 23:38:09,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:38:09,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2025-03-03 23:38:09,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:38:09,855 INFO L225 Difference]: With dead ends: 138 [2025-03-03 23:38:09,855 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 23:38:09,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:38:09,856 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:38:09,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 186 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:38:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 23:38:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-03 23:38:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 23:38:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2025-03-03 23:38:09,868 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 108 [2025-03-03 23:38:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:38:09,869 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2025-03-03 23:38:09,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:38:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2025-03-03 23:38:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 23:38:09,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:38:09,871 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:38:09,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:38:09,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:38:09,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:38:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1466565435, now seen corresponding path program 1 times [2025-03-03 23:38:09,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:38:09,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632602253] [2025-03-03 23:38:09,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:09,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:38:09,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:38:09,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:38:09,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:09,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 23:38:12,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:38:12,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632602253] [2025-03-03 23:38:12,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632602253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:38:12,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531522369] [2025-03-03 23:38:12,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:12,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:38:12,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:38:12,119 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:38:12,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:38:12,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:38:12,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:38:12,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:12,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:12,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 23:38:12,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:38:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-03 23:38:12,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:38:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 23:38:12,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531522369] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:38:12,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:38:12,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 19 [2025-03-03 23:38:12,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520710603] [2025-03-03 23:38:12,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:38:12,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 23:38:12,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:38:12,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 23:38:12,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-03-03 23:38:12,857 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 7 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (45), 6 states have call predecessors, (45), 7 states have call successors, (45) [2025-03-03 23:38:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:38:14,521 INFO L93 Difference]: Finished difference Result 187 states and 265 transitions. [2025-03-03 23:38:14,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 23:38:14,522 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 7 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (45), 6 states have call predecessors, (45), 7 states have call successors, (45) Word has length 109 [2025-03-03 23:38:14,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:38:14,523 INFO L225 Difference]: With dead ends: 187 [2025-03-03 23:38:14,523 INFO L226 Difference]: Without dead ends: 119 [2025-03-03 23:38:14,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2025-03-03 23:38:14,524 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 208 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:38:14,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 303 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 23:38:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-03 23:38:14,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 79. [2025-03-03 23:38:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 23:38:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 108 transitions. [2025-03-03 23:38:14,540 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 108 transitions. Word has length 109 [2025-03-03 23:38:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:38:14,541 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 108 transitions. [2025-03-03 23:38:14,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 7 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (45), 6 states have call predecessors, (45), 7 states have call successors, (45) [2025-03-03 23:38:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 108 transitions. [2025-03-03 23:38:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 23:38:14,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:38:14,542 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:38:14,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:38:14,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 23:38:14,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:38:14,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:38:14,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1977099612, now seen corresponding path program 1 times [2025-03-03 23:38:14,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:38:14,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567714897] [2025-03-03 23:38:14,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:14,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:38:14,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:38:14,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:38:14,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:14,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 23:38:15,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:38:15,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567714897] [2025-03-03 23:38:15,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567714897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:38:15,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234417579] [2025-03-03 23:38:15,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:15,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:38:15,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:38:15,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:38:15,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:38:15,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:38:16,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:38:16,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:16,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:16,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 23:38:16,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:38:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-03 23:38:16,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:38:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 23:38:29,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234417579] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 23:38:29,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:38:29,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 22 [2025-03-03 23:38:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267897882] [2025-03-03 23:38:29,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:38:29,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:38:29,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:38:29,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:38:29,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=364, Unknown=2, NotChecked=0, Total=462 [2025-03-03 23:38:29,327 INFO L87 Difference]: Start difference. First operand 79 states and 108 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:38:39,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-03 23:38:40,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-03 23:38:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:38:40,302 INFO L93 Difference]: Finished difference Result 329 states and 456 transitions. [2025-03-03 23:38:40,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:38:40,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2025-03-03 23:38:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:38:40,304 INFO L225 Difference]: With dead ends: 329 [2025-03-03 23:38:40,304 INFO L226 Difference]: Without dead ends: 253 [2025-03-03 23:38:40,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=137, Invalid=510, Unknown=3, NotChecked=0, Total=650 [2025-03-03 23:38:40,305 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 400 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:38:40,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 376 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 285 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2025-03-03 23:38:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-03 23:38:40,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 103. [2025-03-03 23:38:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 23:38:40,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2025-03-03 23:38:40,317 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 109 [2025-03-03 23:38:40,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:38:40,317 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2025-03-03 23:38:40,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:38:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2025-03-03 23:38:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 23:38:40,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:38:40,318 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:38:40,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 23:38:40,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:38:40,523 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:38:40,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:38:40,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2137833230, now seen corresponding path program 1 times [2025-03-03 23:38:40,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:38:40,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452523093] [2025-03-03 23:38:40,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:40,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:38:40,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:38:40,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:38:40,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:40,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 23:38:41,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:38:41,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452523093] [2025-03-03 23:38:41,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452523093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:38:41,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800483934] [2025-03-03 23:38:41,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:41,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:38:41,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:38:41,504 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:38:41,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 23:38:41,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:38:41,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:38:41,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:41,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:41,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 23:38:41,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:38:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 23:38:41,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:38:41,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800483934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:38:41,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:38:41,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2025-03-03 23:38:41,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032293289] [2025-03-03 23:38:41,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:38:41,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:38:41,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:38:41,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:38:41,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:38:41,829 INFO L87 Difference]: Start difference. First operand 103 states and 144 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:38:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:38:42,074 INFO L93 Difference]: Finished difference Result 307 states and 425 transitions. [2025-03-03 23:38:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:38:42,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2025-03-03 23:38:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:38:42,076 INFO L225 Difference]: With dead ends: 307 [2025-03-03 23:38:42,076 INFO L226 Difference]: Without dead ends: 207 [2025-03-03 23:38:42,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:38:42,077 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 189 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:38:42,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 423 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:38:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-03 23:38:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 131. [2025-03-03 23:38:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.3839285714285714) internal successors, (155), 112 states have internal predecessors, (155), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 23:38:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 185 transitions. [2025-03-03 23:38:42,087 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 185 transitions. Word has length 109 [2025-03-03 23:38:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:38:42,087 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 185 transitions. [2025-03-03 23:38:42,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:38:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 185 transitions. [2025-03-03 23:38:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 23:38:42,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:38:42,088 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:38:42,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 23:38:42,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:38:42,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:38:42,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:38:42,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1473395813, now seen corresponding path program 1 times [2025-03-03 23:38:42,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:38:42,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129540643] [2025-03-03 23:38:42,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:42,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:38:42,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:38:42,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:38:42,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:42,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 23:38:43,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:38:43,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129540643] [2025-03-03 23:38:43,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129540643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:38:43,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504421830] [2025-03-03 23:38:43,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:43,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:38:43,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:38:43,706 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:38:43,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 23:38:43,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:38:43,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:38:43,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:43,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:43,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 23:38:43,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:38:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 228 proven. 42 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-03 23:38:44,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:38:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-03 23:38:44,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504421830] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:38:44,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:38:44,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2025-03-03 23:38:44,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955774587] [2025-03-03 23:38:44,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:38:44,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 23:38:44,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:38:44,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 23:38:44,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2025-03-03 23:38:44,769 INFO L87 Difference]: Start difference. First operand 131 states and 185 transitions. Second operand has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 28 states have internal predecessors, (104), 7 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 7 states have call predecessors, (45), 7 states have call successors, (45) [2025-03-03 23:38:49,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:38:49,118 INFO L93 Difference]: Finished difference Result 490 states and 675 transitions. [2025-03-03 23:38:49,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-03 23:38:49,119 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 28 states have internal predecessors, (104), 7 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 7 states have call predecessors, (45), 7 states have call successors, (45) Word has length 109 [2025-03-03 23:38:49,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:38:49,122 INFO L225 Difference]: With dead ends: 490 [2025-03-03 23:38:49,122 INFO L226 Difference]: Without dead ends: 362 [2025-03-03 23:38:49,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=629, Invalid=2911, Unknown=0, NotChecked=0, Total=3540 [2025-03-03 23:38:49,124 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 1218 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:38:49,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 785 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 23:38:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-03 23:38:49,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 218. [2025-03-03 23:38:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 179 states have (on average 1.3463687150837989) internal successors, (241), 179 states have internal predecessors, (241), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 23:38:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 301 transitions. [2025-03-03 23:38:49,149 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 301 transitions. Word has length 109 [2025-03-03 23:38:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:38:49,149 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 301 transitions. [2025-03-03 23:38:49,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 28 states have internal predecessors, (104), 7 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 7 states have call predecessors, (45), 7 states have call successors, (45) [2025-03-03 23:38:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 301 transitions. [2025-03-03 23:38:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 23:38:49,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:38:49,151 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:38:49,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 23:38:49,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:38:49,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:38:49,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:38:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1765748699, now seen corresponding path program 1 times [2025-03-03 23:38:49,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:38:49,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228435036] [2025-03-03 23:38:49,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:38:49,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:38:49,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:38:49,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:49,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 23:38:49,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:38:49,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228435036] [2025-03-03 23:38:49,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228435036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:38:49,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93205505] [2025-03-03 23:38:49,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:49,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:38:49,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:38:49,842 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:38:49,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 23:38:49,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:38:50,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:38:50,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:50,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:50,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 23:38:50,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:38:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-03 23:38:50,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:38:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 23:38:50,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93205505] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 23:38:50,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:38:50,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 21 [2025-03-03 23:38:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717973408] [2025-03-03 23:38:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:38:50,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:38:50,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:38:50,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:38:50,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-03-03 23:38:50,923 INFO L87 Difference]: Start difference. First operand 218 states and 301 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:38:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:38:52,119 INFO L93 Difference]: Finished difference Result 602 states and 836 transitions. [2025-03-03 23:38:52,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:38:52,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2025-03-03 23:38:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:38:52,122 INFO L225 Difference]: With dead ends: 602 [2025-03-03 23:38:52,122 INFO L226 Difference]: Without dead ends: 387 [2025-03-03 23:38:52,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2025-03-03 23:38:52,123 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 292 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:38:52,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 587 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 23:38:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-03 23:38:52,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 239. [2025-03-03 23:38:52,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 200 states have (on average 1.365) internal successors, (273), 200 states have internal predecessors, (273), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 23:38:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 333 transitions. [2025-03-03 23:38:52,143 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 333 transitions. Word has length 109 [2025-03-03 23:38:52,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:38:52,143 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 333 transitions. [2025-03-03 23:38:52,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:38:52,143 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 333 transitions. [2025-03-03 23:38:52,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 23:38:52,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:38:52,144 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:38:52,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 23:38:52,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:38:52,345 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:38:52,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:38:52,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1945783153, now seen corresponding path program 1 times [2025-03-03 23:38:52,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:38:52,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289676003] [2025-03-03 23:38:52,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:52,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:38:52,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:38:52,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:38:52,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:52,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 23:38:53,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:38:53,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289676003] [2025-03-03 23:38:53,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289676003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:38:53,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404907233] [2025-03-03 23:38:53,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:53,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:38:53,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:38:53,326 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:38:53,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 23:38:53,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:38:53,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:38:53,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:53,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:53,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 23:38:53,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:38:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-03 23:38:53,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:38:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 23:38:54,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404907233] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 23:38:54,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:38:54,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 11] total 23 [2025-03-03 23:38:54,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791958817] [2025-03-03 23:38:54,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:38:54,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:38:54,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:38:54,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:38:54,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-03-03 23:38:54,516 INFO L87 Difference]: Start difference. First operand 239 states and 333 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:38:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:38:55,596 INFO L93 Difference]: Finished difference Result 629 states and 876 transitions. [2025-03-03 23:38:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:38:55,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2025-03-03 23:38:55,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:38:55,599 INFO L225 Difference]: With dead ends: 629 [2025-03-03 23:38:55,599 INFO L226 Difference]: Without dead ends: 393 [2025-03-03 23:38:55,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2025-03-03 23:38:55,600 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 251 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 23:38:55,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 512 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 23:38:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-03 23:38:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 220. [2025-03-03 23:38:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 181 states have (on average 1.3425414364640884) internal successors, (243), 181 states have internal predecessors, (243), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 23:38:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 303 transitions. [2025-03-03 23:38:55,620 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 303 transitions. Word has length 109 [2025-03-03 23:38:55,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:38:55,620 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 303 transitions. [2025-03-03 23:38:55,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:38:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 303 transitions. [2025-03-03 23:38:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 23:38:55,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:38:55,621 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:38:55,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 23:38:55,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:38:55,822 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:38:55,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:38:55,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1851385762, now seen corresponding path program 1 times [2025-03-03 23:38:55,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:38:55,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873876745] [2025-03-03 23:38:55,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:55,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:38:55,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 23:38:55,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 23:38:55,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:55,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:38:55,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66845277] [2025-03-03 23:38:55,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:55,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:38:55,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:38:55,871 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:38:55,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 23:38:55,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 23:38:56,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 23:38:56,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:56,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:56,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 23:38:56,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:38:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-03 23:38:56,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:38:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 23:38:56,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:38:56,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873876745] [2025-03-03 23:38:56,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 23:38:56,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66845277] [2025-03-03 23:38:56,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66845277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:38:56,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:38:56,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-03 23:38:56,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421125179] [2025-03-03 23:38:56,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:38:56,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 23:38:56,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:38:56,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 23:38:56,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-03 23:38:56,392 INFO L87 Difference]: Start difference. First operand 220 states and 303 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-03 23:38:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:38:56,965 INFO L93 Difference]: Finished difference Result 645 states and 871 transitions. [2025-03-03 23:38:56,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 23:38:56,966 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 111 [2025-03-03 23:38:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:38:56,967 INFO L225 Difference]: With dead ends: 645 [2025-03-03 23:38:56,967 INFO L226 Difference]: Without dead ends: 428 [2025-03-03 23:38:56,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2025-03-03 23:38:56,968 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 230 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:38:56,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 624 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:38:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-03 23:38:56,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 325. [2025-03-03 23:38:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 284 states have (on average 1.3591549295774648) internal successors, (386), 284 states have internal predecessors, (386), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 23:38:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 446 transitions. [2025-03-03 23:38:56,987 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 446 transitions. Word has length 111 [2025-03-03 23:38:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:38:56,987 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 446 transitions. [2025-03-03 23:38:56,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-03 23:38:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 446 transitions. [2025-03-03 23:38:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 23:38:56,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:38:56,989 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:38:56,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 23:38:57,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 23:38:57,189 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:38:57,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:38:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash 859993294, now seen corresponding path program 1 times [2025-03-03 23:38:57,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:38:57,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879777714] [2025-03-03 23:38:57,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:57,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:38:57,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 23:38:57,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 23:38:57,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:57,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:57,619 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 23:38:57,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:38:57,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879777714] [2025-03-03 23:38:57,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879777714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:38:57,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:38:57,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:38:57,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493818969] [2025-03-03 23:38:57,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:38:57,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:38:57,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:38:57,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:38:57,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:38:57,621 INFO L87 Difference]: Start difference. First operand 325 states and 446 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:38:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:38:57,972 INFO L93 Difference]: Finished difference Result 1105 states and 1476 transitions. [2025-03-03 23:38:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:38:57,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2025-03-03 23:38:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:38:57,976 INFO L225 Difference]: With dead ends: 1105 [2025-03-03 23:38:57,976 INFO L226 Difference]: Without dead ends: 783 [2025-03-03 23:38:57,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:38:57,978 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 191 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:38:57,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 454 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:38:57,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-03-03 23:38:58,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 507. [2025-03-03 23:38:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 434 states have (on average 1.3387096774193548) internal successors, (581), 436 states have internal predecessors, (581), 52 states have call successors, (52), 20 states have call predecessors, (52), 20 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 23:38:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 685 transitions. [2025-03-03 23:38:58,016 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 685 transitions. Word has length 111 [2025-03-03 23:38:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:38:58,016 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 685 transitions. [2025-03-03 23:38:58,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:38:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 685 transitions. [2025-03-03 23:38:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 23:38:58,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:38:58,018 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:38:58,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 23:38:58,019 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:38:58,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:38:58,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1881731789, now seen corresponding path program 1 times [2025-03-03 23:38:58,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:38:58,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746387086] [2025-03-03 23:38:58,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:58,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:38:58,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 23:38:58,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 23:38:58,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:58,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 23:38:58,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:38:58,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746387086] [2025-03-03 23:38:58,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746387086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:38:58,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:38:58,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:38:58,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198976] [2025-03-03 23:38:58,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:38:58,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:38:58,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:38:58,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:38:58,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:38:58,055 INFO L87 Difference]: Start difference. First operand 507 states and 685 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:38:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:38:58,134 INFO L93 Difference]: Finished difference Result 1128 states and 1510 transitions. [2025-03-03 23:38:58,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:38:58,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2025-03-03 23:38:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:38:58,140 INFO L225 Difference]: With dead ends: 1128 [2025-03-03 23:38:58,141 INFO L226 Difference]: Without dead ends: 662 [2025-03-03 23:38:58,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:38:58,143 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 82 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:38:58,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 193 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:38:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-03 23:38:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 528. [2025-03-03 23:38:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 433 states have (on average 1.2956120092378753) internal successors, (561), 436 states have internal predecessors, (561), 67 states have call successors, (67), 27 states have call predecessors, (67), 27 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-03 23:38:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 695 transitions. [2025-03-03 23:38:58,185 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 695 transitions. Word has length 111 [2025-03-03 23:38:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:38:58,187 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 695 transitions. [2025-03-03 23:38:58,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:38:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 695 transitions. [2025-03-03 23:38:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 23:38:58,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:38:58,188 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:38:58,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 23:38:58,189 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:38:58,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:38:58,189 INFO L85 PathProgramCache]: Analyzing trace with hash -442382588, now seen corresponding path program 1 times [2025-03-03 23:38:58,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:38:58,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393031685] [2025-03-03 23:38:58,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:38:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:38:58,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 23:38:58,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 23:38:58,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:38:58,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:38:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 23:38:59,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:38:59,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393031685] [2025-03-03 23:38:59,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393031685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:38:59,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:38:59,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 23:38:59,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107374804] [2025-03-03 23:38:59,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:38:59,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:38:59,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:38:59,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:38:59,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:38:59,311 INFO L87 Difference]: Start difference. First operand 528 states and 695 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:39:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:39:01,079 INFO L93 Difference]: Finished difference Result 1296 states and 1710 transitions. [2025-03-03 23:39:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 23:39:01,080 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2025-03-03 23:39:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:39:01,082 INFO L225 Difference]: With dead ends: 1296 [2025-03-03 23:39:01,082 INFO L226 Difference]: Without dead ends: 809 [2025-03-03 23:39:01,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-03 23:39:01,085 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 336 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 23:39:01,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 760 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 23:39:01,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-03-03 23:39:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 636. [2025-03-03 23:39:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 541 states have (on average 1.3142329020332717) internal successors, (711), 544 states have internal predecessors, (711), 67 states have call successors, (67), 27 states have call predecessors, (67), 27 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-03 23:39:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 845 transitions. [2025-03-03 23:39:01,126 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 845 transitions. Word has length 112 [2025-03-03 23:39:01,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:39:01,127 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 845 transitions. [2025-03-03 23:39:01,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:39:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 845 transitions. [2025-03-03 23:39:01,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 23:39:01,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:39:01,129 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:39:01,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 23:39:01,129 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:39:01,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:39:01,129 INFO L85 PathProgramCache]: Analyzing trace with hash -219356602, now seen corresponding path program 1 times [2025-03-03 23:39:01,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:39:01,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442527872] [2025-03-03 23:39:01,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:01,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:39:01,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 23:39:01,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 23:39:01,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:01,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:39:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 23:39:01,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:39:01,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442527872] [2025-03-03 23:39:01,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442527872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:39:01,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:39:01,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 23:39:01,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682881161] [2025-03-03 23:39:01,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:39:01,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:39:01,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:39:01,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:39:01,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:39:01,384 INFO L87 Difference]: Start difference. First operand 636 states and 845 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:39:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:39:01,791 INFO L93 Difference]: Finished difference Result 1495 states and 1988 transitions. [2025-03-03 23:39:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 23:39:01,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2025-03-03 23:39:01,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:39:01,795 INFO L225 Difference]: With dead ends: 1495 [2025-03-03 23:39:01,795 INFO L226 Difference]: Without dead ends: 900 [2025-03-03 23:39:01,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:39:01,797 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 95 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:39:01,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 488 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:39:01,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2025-03-03 23:39:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 690. [2025-03-03 23:39:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 595 states have (on average 1.319327731092437) internal successors, (785), 598 states have internal predecessors, (785), 67 states have call successors, (67), 27 states have call predecessors, (67), 27 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-03 23:39:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 919 transitions. [2025-03-03 23:39:01,842 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 919 transitions. Word has length 112 [2025-03-03 23:39:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:39:01,842 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 919 transitions. [2025-03-03 23:39:01,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 23:39:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 919 transitions. [2025-03-03 23:39:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 23:39:01,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:39:01,843 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:39:01,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 23:39:01,844 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:39:01,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:39:01,844 INFO L85 PathProgramCache]: Analyzing trace with hash 75206788, now seen corresponding path program 1 times [2025-03-03 23:39:01,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:39:01,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311145049] [2025-03-03 23:39:01,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:01,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:39:01,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 23:39:01,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 23:39:01,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:01,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:39:01,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656872094] [2025-03-03 23:39:01,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:01,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:39:01,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:39:01,877 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:39:01,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 23:39:01,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 23:39:02,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 23:39:02,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:02,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:39:02,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:39:02,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 23:39:02,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 23:39:02,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:02,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:39:02,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:39:02,243 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:39:02,244 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:39:02,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 23:39:02,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 23:39:02,449 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:39:02,504 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:39:02,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:39:02 BoogieIcfgContainer [2025-03-03 23:39:02,506 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:39:02,507 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:39:02,507 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:39:02,507 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:39:02,508 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:38:08" (3/4) ... [2025-03-03 23:39:02,509 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:39:02,510 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:39:02,510 INFO L158 Benchmark]: Toolchain (without parser) took 54275.49ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 133.2MB in the beginning and 264.6MB in the end (delta: -131.4MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2025-03-03 23:39:02,511 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:39:02,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.56ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 119.3MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:39:02,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.51ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 116.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:39:02,511 INFO L158 Benchmark]: Boogie Preprocessor took 27.31ms. Allocated memory is still 167.8MB. Free memory was 116.8MB in the beginning and 114.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:39:02,512 INFO L158 Benchmark]: IcfgBuilder took 370.27ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 91.7MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 23:39:02,512 INFO L158 Benchmark]: TraceAbstraction took 53594.93ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 91.2MB in the beginning and 264.7MB in the end (delta: -173.4MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2025-03-03 23:39:02,512 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 369.1MB. Free memory was 264.7MB in the beginning and 264.6MB in the end (delta: 115.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:39:02,513 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.87ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.56ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 119.3MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.51ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 116.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.31ms. Allocated memory is still 167.8MB. Free memory was 116.8MB in the beginning and 114.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 370.27ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 91.7MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 53594.93ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 91.2MB in the beginning and 264.7MB in the end (delta: -173.4MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 369.1MB. Free memory was 264.7MB in the beginning and 264.6MB in the end (delta: 115.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 51, overapproximation of shiftLeft at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L123] isInitial = 1 [L124] FCALL initially() [L125] int k_loop; [L126] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] COND TRUE k_loop < 1 [L127] CALL updateLastVariables() [L114] last_1_var_1_10 = var_1_10 [L115] last_1_var_1_12 = var_1_12 [L116] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_5 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] var_1_6 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] var_1_7 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] var_1_8 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L104] var_1_9 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L108] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-762, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-762, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-762, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-762, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-762, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-762, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-762, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-762, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-762, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L128] RET updateVariables() [L129] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-762, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=-762, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L46] COND TRUE var_1_6 <= stepLocal_2 [L47] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L60] var_1_18 = var_1_3 [L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L62] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=-762, stepLocal_4=6, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L63] COND FALSE !((- var_1_9) <= var_1_8) [L76] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=-762, stepLocal_4=6, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=-762, stepLocal_4=6, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L79] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=-762, stepLocal_4=6, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L79] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=-762, stepLocal_4=6, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L129] RET step() [L130] CALL, EXPR property() [L119] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L119] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-762, var_1_11=-762, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.5s, OverallIterations: 14, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 3499 SdHoareTripleChecker+Valid, 14.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3492 mSDsluCounter, 5790 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4444 mSDsCounter, 273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5077 IncrementalHoareTripleChecker+Invalid, 5351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 273 mSolverCounterUnsat, 1346 mSDtfsCounter, 5077 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1724 GetRequests, 1494 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 24.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=690occurred in iteration=13, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 1627 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 26.2s InterpolantComputationTime, 2524 NumberOfCodeBlocks, 2524 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2819 ConstructedInterpolants, 15 QuantifiedInterpolants, 13242 SizeOfPredicates, 57 NumberOfNonLiveVariables, 2165 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 26 InterpolantComputations, 10 PerfectInterpolantSequences, 10589/10920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:39:02,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_loopvsstraightlinecode_50-1loop_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:39:04,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:39:04,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:39:04,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:39:04,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:39:04,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:39:04,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:39:04,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:39:04,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:39:04,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:39:04,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:39:04,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:39:04,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:39:04,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:39:04,491 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:39:04,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:39:04,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:39:04,491 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:39:04,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:39:04,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:39:04,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:39:04,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:39:04,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:39:04,492 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:39:04,492 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:39:04,492 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:39:04,492 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:39:04,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:39:04,492 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:39:04,492 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:39:04,492 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:39:04,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:39:04,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:39:04,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:39:04,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:39:04,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:39:04,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:39:04,493 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:39:04,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:39:04,494 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:39:04,494 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:39:04,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:39:04,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:39:04,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:39:04,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:39:04,494 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d [2025-03-03 23:39:04,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:39:04,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:39:04,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:39:04,810 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:39:04,810 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:39:04,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2025-03-03 23:39:05,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f780e2a01/9c5b17cbcead427c862ce9ba2a44a506/FLAG7272001f5 [2025-03-03 23:39:06,190 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:39:06,191 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2025-03-03 23:39:06,198 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f780e2a01/9c5b17cbcead427c862ce9ba2a44a506/FLAG7272001f5 [2025-03-03 23:39:06,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f780e2a01/9c5b17cbcead427c862ce9ba2a44a506 [2025-03-03 23:39:06,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:39:06,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:39:06,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:39:06,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:39:06,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:39:06,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:39:06" (1/1) ... [2025-03-03 23:39:06,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@256bc0ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06, skipping insertion in model container [2025-03-03 23:39:06,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:39:06" (1/1) ... [2025-03-03 23:39:06,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:39:06,345 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_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2025-03-03 23:39:06,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:39:06,410 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:39:06,420 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_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2025-03-03 23:39:06,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:39:06,466 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:39:06,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06 WrapperNode [2025-03-03 23:39:06,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:39:06,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:39:06,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:39:06,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:39:06,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06" (1/1) ... [2025-03-03 23:39:06,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06" (1/1) ... [2025-03-03 23:39:06,512 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-03-03 23:39:06,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:39:06,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:39:06,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:39:06,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:39:06,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06" (1/1) ... [2025-03-03 23:39:06,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06" (1/1) ... [2025-03-03 23:39:06,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06" (1/1) ... [2025-03-03 23:39:06,538 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]. [2025-03-03 23:39:06,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06" (1/1) ... [2025-03-03 23:39:06,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06" (1/1) ... [2025-03-03 23:39:06,547 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06" (1/1) ... [2025-03-03 23:39:06,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06" (1/1) ... [2025-03-03 23:39:06,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06" (1/1) ... [2025-03-03 23:39:06,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06" (1/1) ... [2025-03-03 23:39:06,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:39:06,559 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:39:06,562 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:39:06,562 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:39:06,563 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06" (1/1) ... [2025-03-03 23:39:06,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:39:06,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:39:06,591 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) [2025-03-03 23:39:06,593 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 [2025-03-03 23:39:06,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:39:06,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:39:06,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:39:06,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:39:06,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:39:06,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:39:06,661 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:39:06,662 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:39:06,957 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 23:39:06,958 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:39:06,963 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:39:06,964 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:39:06,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:39:06 BoogieIcfgContainer [2025-03-03 23:39:06,964 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:39:06,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:39:06,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:39:06,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:39:06,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:39:06" (1/3) ... [2025-03-03 23:39:06,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee63096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:39:06, skipping insertion in model container [2025-03-03 23:39:06,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:39:06" (2/3) ... [2025-03-03 23:39:06,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee63096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:39:06, skipping insertion in model container [2025-03-03 23:39:06,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:39:06" (3/3) ... [2025-03-03 23:39:06,971 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-9.i [2025-03-03 23:39:06,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:39:06,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-9.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:39:07,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:39:07,028 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;@13569ed1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:39:07,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:39:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 23:39:07,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 23:39:07,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:39:07,039 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:39:07,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:39:07,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:39:07,043 INFO L85 PathProgramCache]: Analyzing trace with hash -492241412, now seen corresponding path program 1 times [2025-03-03 23:39:07,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:39:07,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656785103] [2025-03-03 23:39:07,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:07,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:39:07,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:39:07,055 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:39:07,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 23:39:07,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 23:39:07,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 23:39:07,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:07,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:39:07,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:39:07,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:39:07,280 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-03 23:39:07,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:39:07,280 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:39:07,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656785103] [2025-03-03 23:39:07,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656785103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:39:07,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:39:07,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:39:07,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012483823] [2025-03-03 23:39:07,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:39:07,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:39:07,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:39:07,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:39:07,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:39:07,300 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 23:39:07,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:39:07,314 INFO L93 Difference]: Finished difference Result 105 states and 172 transitions. [2025-03-03 23:39:07,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:39:07,315 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-03-03 23:39:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:39:07,319 INFO L225 Difference]: With dead ends: 105 [2025-03-03 23:39:07,319 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 23:39:07,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:39:07,322 INFO L435 NwaCegarLoop]: 77 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, 77 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 [2025-03-03 23:39:07,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:39:07,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 23:39:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-03 23:39:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 23:39:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2025-03-03 23:39:07,352 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 100 [2025-03-03 23:39:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:39:07,353 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2025-03-03 23:39:07,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 23:39:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2025-03-03 23:39:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 23:39:07,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:39:07,355 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:39:07,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 23:39:07,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:39:07,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:39:07,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:39:07,557 INFO L85 PathProgramCache]: Analyzing trace with hash -577946124, now seen corresponding path program 1 times [2025-03-03 23:39:07,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:39:07,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345956671] [2025-03-03 23:39:07,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:39:07,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:39:07,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:39:07,559 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:39:07,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 23:39:07,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 23:39:07,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 23:39:07,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:39:07,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:39:07,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 23:39:07,740 INFO L279 TraceCheckSpWp]: Computing forward predicates...