./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-38.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 e4116054e7338e37f5204f84ea9d95032295044fbcd5b21bea8f2797dfdd1b8f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:18:11,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:18:11,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:18:11,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:18:11,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:18:11,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:18:11,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:18:11,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:18:11,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:18:11,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:18:11,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:18:11,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:18:11,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:18:11,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:18:11,258 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:18:11,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:18:11,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:18:11,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:18:11,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:18:11,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:18:11,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:18:11,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:18:11,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:18:11,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:18:11,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:18:11,265 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:18:11,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:18:11,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:18:11,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:18:11,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:18:11,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:18:11,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:18:11,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:18:11,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:18:11,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:18:11,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:18:11,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:18:11,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:18:11,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:18:11,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:18:11,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:18:11,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:18:11,273 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4116054e7338e37f5204f84ea9d95032295044fbcd5b21bea8f2797dfdd1b8f [2024-10-14 12:18:11,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:18:11,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:18:11,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:18:11,556 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:18:11,556 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:18:11,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-38.i [2024-10-14 12:18:12,935 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:18:13,147 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:18:13,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-38.i [2024-10-14 12:18:13,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9309bccd/ff07c5653c214450973185d7d407e93c/FLAGb0a69659e [2024-10-14 12:18:13,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9309bccd/ff07c5653c214450973185d7d407e93c [2024-10-14 12:18:13,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:18:13,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:18:13,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:18:13,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:18:13,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:18:13,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:18:13" (1/1) ... [2024-10-14 12:18:13,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40dac530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13, skipping insertion in model container [2024-10-14 12:18:13,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:18:13" (1/1) ... [2024-10-14 12:18:13,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:18:13,690 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-38.i[916,929] [2024-10-14 12:18:13,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:18:13,796 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:18:13,805 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-38.i[916,929] [2024-10-14 12:18:13,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:18:13,846 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:18:13,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13 WrapperNode [2024-10-14 12:18:13,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:18:13,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:18:13,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:18:13,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:18:13,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13" (1/1) ... [2024-10-14 12:18:13,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13" (1/1) ... [2024-10-14 12:18:13,908 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-10-14 12:18:13,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:18:13,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:18:13,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:18:13,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:18:13,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13" (1/1) ... [2024-10-14 12:18:13,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13" (1/1) ... [2024-10-14 12:18:13,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13" (1/1) ... [2024-10-14 12:18:13,963 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 12:18:13,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13" (1/1) ... [2024-10-14 12:18:13,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13" (1/1) ... [2024-10-14 12:18:13,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13" (1/1) ... [2024-10-14 12:18:13,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13" (1/1) ... [2024-10-14 12:18:13,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13" (1/1) ... [2024-10-14 12:18:13,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13" (1/1) ... [2024-10-14 12:18:14,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:18:14,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:18:14,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:18:14,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:18:14,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13" (1/1) ... [2024-10-14 12:18:14,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:18:14,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:18:14,058 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 12:18:14,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 12:18:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:18:14,108 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:18:14,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:18:14,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:18:14,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:18:14,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:18:14,194 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:18:14,196 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:18:14,526 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-14 12:18:14,527 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:18:14,592 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:18:14,592 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:18:14,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:18:14 BoogieIcfgContainer [2024-10-14 12:18:14,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:18:14,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:18:14,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:18:14,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:18:14,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:18:13" (1/3) ... [2024-10-14 12:18:14,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53015021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:18:14, skipping insertion in model container [2024-10-14 12:18:14,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:13" (2/3) ... [2024-10-14 12:18:14,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53015021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:18:14, skipping insertion in model container [2024-10-14 12:18:14,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:18:14" (3/3) ... [2024-10-14 12:18:14,603 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-38.i [2024-10-14 12:18:14,623 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:18:14,624 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:18:14,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:18:14,730 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;@4ff1bc01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:18:14,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:18:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 44 states have internal predecessors, (69), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:18:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 12:18:14,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:18:14,747 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:18:14,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:18:14,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:18:14,754 INFO L85 PathProgramCache]: Analyzing trace with hash 45234567, now seen corresponding path program 1 times [2024-10-14 12:18:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:18:14,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633338788] [2024-10-14 12:18:14,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:14,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:18:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:18:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:18:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:18:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:18:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:18:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:18:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:18:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:18:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:18:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:18:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:18:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:18:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:18:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:18:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:18:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:18:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:18:15,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:18:15,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633338788] [2024-10-14 12:18:15,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633338788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:18:15,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:18:15,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:18:15,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217271100] [2024-10-14 12:18:15,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:18:15,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:18:15,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:18:15,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:18:15,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:18:15,194 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 44 states have internal predecessors, (69), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 12:18:15,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:18:15,226 INFO L93 Difference]: Finished difference Result 121 states and 216 transitions. [2024-10-14 12:18:15,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:18:15,229 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 109 [2024-10-14 12:18:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:18:15,235 INFO L225 Difference]: With dead ends: 121 [2024-10-14 12:18:15,235 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 12:18:15,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:18:15,241 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:18:15,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:18:15,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 12:18:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-14 12:18:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 42 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:18:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 96 transitions. [2024-10-14 12:18:15,299 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 96 transitions. Word has length 109 [2024-10-14 12:18:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:18:15,299 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 96 transitions. [2024-10-14 12:18:15,299 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 12:18:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 96 transitions. [2024-10-14 12:18:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 12:18:15,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:18:15,302 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:18:15,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:18:15,303 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:18:15,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:18:15,303 INFO L85 PathProgramCache]: Analyzing trace with hash -111892277, now seen corresponding path program 1 times [2024-10-14 12:18:15,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:18:15,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884463326] [2024-10-14 12:18:15,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:15,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:18:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:18:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:18:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:18:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:18:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:18:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:18:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:18:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:18:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:18:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:18:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:18:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:18:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:18:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:18:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:18:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:18:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:18:16,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:18:16,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884463326] [2024-10-14 12:18:16,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884463326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:18:16,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:18:16,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 12:18:16,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756636442] [2024-10-14 12:18:16,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:18:16,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:18:16,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:18:16,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:18:16,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:18:16,217 INFO L87 Difference]: Start difference. First operand 60 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:18:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:18:16,521 INFO L93 Difference]: Finished difference Result 161 states and 258 transitions. [2024-10-14 12:18:16,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 12:18:16,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-10-14 12:18:16,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:18:16,526 INFO L225 Difference]: With dead ends: 161 [2024-10-14 12:18:16,526 INFO L226 Difference]: Without dead ends: 102 [2024-10-14 12:18:16,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 12:18:16,530 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 73 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 12:18:16,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 353 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 12:18:16,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-14 12:18:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 74. [2024-10-14 12:18:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 56 states have internal predecessors, (88), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:18:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2024-10-14 12:18:16,549 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 109 [2024-10-14 12:18:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:18:16,551 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2024-10-14 12:18:16,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:18:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2024-10-14 12:18:16,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 12:18:16,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:18:16,554 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:18:16,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 12:18:16,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:18:16,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:18:16,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2038112022, now seen corresponding path program 1 times [2024-10-14 12:18:16,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:18:16,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843206570] [2024-10-14 12:18:16,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:16,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:18:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:18:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:18:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:18:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:18:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:18:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:18:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:18:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:18:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:18:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:18:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:18:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:18:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:18:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:18:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:18:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:18:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:18:16,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:18:16,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843206570] [2024-10-14 12:18:16,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843206570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:18:16,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:18:16,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:18:16,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588774648] [2024-10-14 12:18:16,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:18:16,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:18:16,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:18:16,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:18:16,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:18:16,734 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:18:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:18:16,893 INFO L93 Difference]: Finished difference Result 314 states and 502 transitions. [2024-10-14 12:18:16,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:18:16,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-10-14 12:18:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:18:16,898 INFO L225 Difference]: With dead ends: 314 [2024-10-14 12:18:16,900 INFO L226 Difference]: Without dead ends: 241 [2024-10-14 12:18:16,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:18:16,902 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 184 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:18:16,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 358 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:18:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-14 12:18:16,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 154. [2024-10-14 12:18:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 129 states have (on average 1.5193798449612403) internal successors, (196), 130 states have internal predecessors, (196), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 12:18:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 240 transitions. [2024-10-14 12:18:16,919 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 240 transitions. Word has length 110 [2024-10-14 12:18:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:18:16,920 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 240 transitions. [2024-10-14 12:18:16,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:18:16,920 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 240 transitions. [2024-10-14 12:18:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 12:18:16,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:18:16,922 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:18:16,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 12:18:16,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:18:16,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:18:16,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2095370324, now seen corresponding path program 1 times [2024-10-14 12:18:16,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:18:16,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922545201] [2024-10-14 12:18:16,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:16,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:18:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:18:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:18:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:18:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:18:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:18:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:18:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:18:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:18:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:18:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:18:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:18:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:18:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:18:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:18:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:18:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:18:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-14 12:18:17,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:18:17,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922545201] [2024-10-14 12:18:17,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922545201] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 12:18:17,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887536357] [2024-10-14 12:18:17,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:17,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:18:17,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:18:17,240 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) [2024-10-14 12:18:17,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 12:18:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:17,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 12:18:17,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:18:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 249 proven. 18 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2024-10-14 12:18:17,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 12:18:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 27 proven. 18 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-14 12:18:17,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887536357] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 12:18:17,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 12:18:17,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-14 12:18:17,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439753399] [2024-10-14 12:18:17,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 12:18:17,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 12:18:17,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:18:17,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 12:18:17,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 12:18:17,651 INFO L87 Difference]: Start difference. First operand 154 states and 240 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-10-14 12:18:17,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:18:17,933 INFO L93 Difference]: Finished difference Result 272 states and 414 transitions. [2024-10-14 12:18:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 12:18:17,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 110 [2024-10-14 12:18:17,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:18:17,935 INFO L225 Difference]: With dead ends: 272 [2024-10-14 12:18:17,935 INFO L226 Difference]: Without dead ends: 119 [2024-10-14 12:18:17,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-10-14 12:18:17,936 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 120 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 12:18:17,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 193 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 12:18:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-14 12:18:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2024-10-14 12:18:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 88 states have internal predecessors, (120), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 12:18:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-10-14 12:18:17,958 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 110 [2024-10-14 12:18:17,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:18:17,959 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-10-14 12:18:17,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-10-14 12:18:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-10-14 12:18:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 12:18:17,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:18:17,960 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:18:17,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 12:18:18,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:18:18,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:18:18,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:18:18,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1251851394, now seen corresponding path program 1 times [2024-10-14 12:18:18,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:18:18,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211268072] [2024-10-14 12:18:18,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:18,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:18:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:18:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:18:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:18:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:18:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:18:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:18:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:18:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:18:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:18:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:18:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:18:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:18:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:18:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:18:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:18:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:18:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:18:18,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:18:18,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211268072] [2024-10-14 12:18:18,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211268072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:18:18,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:18:18,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 12:18:18,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851511898] [2024-10-14 12:18:18,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:18:18,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:18:18,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:18:18,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:18:18,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:18:18,552 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:18:18,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:18:18,674 INFO L93 Difference]: Finished difference Result 263 states and 375 transitions. [2024-10-14 12:18:18,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:18:18,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-10-14 12:18:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:18:18,680 INFO L225 Difference]: With dead ends: 263 [2024-10-14 12:18:18,680 INFO L226 Difference]: Without dead ends: 164 [2024-10-14 12:18:18,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:18:18,682 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 166 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:18:18,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 174 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:18:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-14 12:18:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2024-10-14 12:18:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:18:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 176 transitions. [2024-10-14 12:18:18,697 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 176 transitions. Word has length 111 [2024-10-14 12:18:18,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:18:18,698 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 176 transitions. [2024-10-14 12:18:18,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:18:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 176 transitions. [2024-10-14 12:18:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 12:18:18,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:18:18,700 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:18:18,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 12:18:18,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:18:18,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:18:18,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1876498504, now seen corresponding path program 1 times [2024-10-14 12:18:18,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:18:18,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431796300] [2024-10-14 12:18:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:18,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:18:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:18:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:18:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:18:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:18:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:18:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:18:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:18:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:18:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:18:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:18:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:18:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:18:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:18:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:18:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:18:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:18:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:18:19,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:18:19,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431796300] [2024-10-14 12:18:19,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431796300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:18:19,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:18:19,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:18:19,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990869429] [2024-10-14 12:18:19,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:18:19,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:18:19,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:18:19,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:18:19,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:18:19,261 INFO L87 Difference]: Start difference. First operand 126 states and 176 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 12:18:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:18:19,309 INFO L93 Difference]: Finished difference Result 251 states and 351 transitions. [2024-10-14 12:18:19,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:18:19,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 111 [2024-10-14 12:18:19,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:18:19,312 INFO L225 Difference]: With dead ends: 251 [2024-10-14 12:18:19,312 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 12:18:19,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:18:19,313 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:18:19,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 88 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:18:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 12:18:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-14 12:18:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:18:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 174 transitions. [2024-10-14 12:18:19,330 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 174 transitions. Word has length 111 [2024-10-14 12:18:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:18:19,330 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 174 transitions. [2024-10-14 12:18:19,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 12:18:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 174 transitions. [2024-10-14 12:18:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 12:18:19,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:18:19,332 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:18:19,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 12:18:19,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:18:19,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:18:19,333 INFO L85 PathProgramCache]: Analyzing trace with hash 288150602, now seen corresponding path program 1 times [2024-10-14 12:18:19,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:18:19,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714598232] [2024-10-14 12:18:19,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:19,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:18:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:18:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:18:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:18:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:18:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:18:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:18:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:18:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:18:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:18:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:18:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:18:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:18:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:18:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:18:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:18:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:18:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:18:19,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:18:19,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714598232] [2024-10-14 12:18:19,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714598232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:18:19,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:18:19,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:18:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562282950] [2024-10-14 12:18:19,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:18:19,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:18:19,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:18:19,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:18:19,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:18:19,611 INFO L87 Difference]: Start difference. First operand 126 states and 174 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:18:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:18:19,658 INFO L93 Difference]: Finished difference Result 254 states and 349 transitions. [2024-10-14 12:18:19,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:18:19,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-10-14 12:18:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:18:19,660 INFO L225 Difference]: With dead ends: 254 [2024-10-14 12:18:19,660 INFO L226 Difference]: Without dead ends: 129 [2024-10-14 12:18:19,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:18:19,661 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 47 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:18:19,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 206 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:18:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-14 12:18:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2024-10-14 12:18:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 92 states have internal predecessors, (118), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:18:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 150 transitions. [2024-10-14 12:18:19,675 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 150 transitions. Word has length 111 [2024-10-14 12:18:19,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:18:19,675 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 150 transitions. [2024-10-14 12:18:19,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:18:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 150 transitions. [2024-10-14 12:18:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 12:18:19,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:18:19,677 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:18:19,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 12:18:19,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:18:19,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:18:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash 874956616, now seen corresponding path program 1 times [2024-10-14 12:18:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:18:19,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860440941] [2024-10-14 12:18:19,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:19,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:18:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:18:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:18:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:18:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:18:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:18:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:18:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:18:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:18:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:18:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:18:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:18:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:18:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:18:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:18:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:18:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:18:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-14 12:18:20,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:18:20,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860440941] [2024-10-14 12:18:20,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860440941] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 12:18:20,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603066666] [2024-10-14 12:18:20,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:20,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:18:20,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:18:20,114 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) [2024-10-14 12:18:20,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 12:18:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:20,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 12:18:20,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:18:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 12:18:20,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 12:18:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-14 12:18:21,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603066666] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 12:18:21,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 12:18:21,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2024-10-14 12:18:21,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864110760] [2024-10-14 12:18:21,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 12:18:21,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 12:18:21,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:18:21,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 12:18:21,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-14 12:18:21,011 INFO L87 Difference]: Start difference. First operand 114 states and 150 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2024-10-14 12:18:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:18:21,648 INFO L93 Difference]: Finished difference Result 340 states and 441 transitions. [2024-10-14 12:18:21,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 12:18:21,649 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) Word has length 111 [2024-10-14 12:18:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:18:21,651 INFO L225 Difference]: With dead ends: 340 [2024-10-14 12:18:21,651 INFO L226 Difference]: Without dead ends: 227 [2024-10-14 12:18:21,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-10-14 12:18:21,653 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 183 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 12:18:21,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 403 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 12:18:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-14 12:18:21,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 118. [2024-10-14 12:18:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.263157894736842) internal successors, (120), 95 states have internal predecessors, (120), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:18:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 152 transitions. [2024-10-14 12:18:21,690 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 152 transitions. Word has length 111 [2024-10-14 12:18:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:18:21,691 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 152 transitions. [2024-10-14 12:18:21,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2024-10-14 12:18:21,691 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 152 transitions. [2024-10-14 12:18:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 12:18:21,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:18:21,693 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:18:21,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 12:18:21,896 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,SelfDestructingSolverStorable7 [2024-10-14 12:18:21,897 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:18:21,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:18:21,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1338865601, now seen corresponding path program 1 times [2024-10-14 12:18:21,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:18:21,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940238280] [2024-10-14 12:18:21,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:21,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:18:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:18:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:18:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:18:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:18:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:18:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:18:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:18:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:18:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:18:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:18:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:18:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:18:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:18:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:18:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:18:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:21,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:18:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:18:22,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:18:22,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940238280] [2024-10-14 12:18:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940238280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:18:22,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:18:22,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:18:22,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072093031] [2024-10-14 12:18:22,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:18:22,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:18:22,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:18:22,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:18:22,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:18:22,007 INFO L87 Difference]: Start difference. First operand 118 states and 152 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:18:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:18:22,034 INFO L93 Difference]: Finished difference Result 235 states and 303 transitions. [2024-10-14 12:18:22,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:18:22,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-10-14 12:18:22,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:18:22,036 INFO L225 Difference]: With dead ends: 235 [2024-10-14 12:18:22,036 INFO L226 Difference]: Without dead ends: 118 [2024-10-14 12:18:22,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:18:22,037 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:18:22,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 84 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:18:22,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-14 12:18:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-14 12:18:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:18:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 151 transitions. [2024-10-14 12:18:22,055 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 151 transitions. Word has length 112 [2024-10-14 12:18:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:18:22,056 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 151 transitions. [2024-10-14 12:18:22,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:18:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 151 transitions. [2024-10-14 12:18:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 12:18:22,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:18:22,057 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:18:22,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 12:18:22,058 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:18:22,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:18:22,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1454432877, now seen corresponding path program 1 times [2024-10-14 12:18:22,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:18:22,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457303973] [2024-10-14 12:18:22,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:18:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 12:18:22,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2074177608] [2024-10-14 12:18:22,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:22,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:18:22,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:18:22,166 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) [2024-10-14 12:18:22,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 12:18:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:18:22,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 12:18:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:18:22,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 12:18:22,768 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 12:18:22,769 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 12:18:22,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 12:18:22,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:18:22,974 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:18:23,079 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 12:18:23,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:18:23 BoogieIcfgContainer [2024-10-14 12:18:23,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 12:18:23,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 12:18:23,085 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 12:18:23,085 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 12:18:23,085 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:18:14" (3/4) ... [2024-10-14 12:18:23,087 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 12:18:23,088 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 12:18:23,088 INFO L158 Benchmark]: Toolchain (without parser) took 9583.79ms. Allocated memory was 195.0MB in the beginning and 285.2MB in the end (delta: 90.2MB). Free memory was 163.6MB in the beginning and 107.2MB in the end (delta: 56.4MB). Peak memory consumption was 146.3MB. Max. memory is 16.1GB. [2024-10-14 12:18:23,088 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 125.8MB. Free memory was 86.9MB in the beginning and 86.8MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:18:23,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.63ms. Allocated memory is still 195.0MB. Free memory was 163.6MB in the beginning and 146.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 12:18:23,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.01ms. Allocated memory is still 195.0MB. Free memory was 146.0MB in the beginning and 141.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 12:18:23,089 INFO L158 Benchmark]: Boogie Preprocessor took 97.37ms. Allocated memory is still 195.0MB. Free memory was 141.3MB in the beginning and 130.0MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 12:18:23,089 INFO L158 Benchmark]: RCFGBuilder took 585.19ms. Allocated memory is still 195.0MB. Free memory was 130.0MB in the beginning and 158.6MB in the end (delta: -28.6MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2024-10-14 12:18:23,090 INFO L158 Benchmark]: TraceAbstraction took 8488.94ms. Allocated memory was 195.0MB in the beginning and 285.2MB in the end (delta: 90.2MB). Free memory was 157.6MB in the beginning and 108.2MB in the end (delta: 49.3MB). Peak memory consumption was 139.5MB. Max. memory is 16.1GB. [2024-10-14 12:18:23,090 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 285.2MB. Free memory was 108.2MB in the beginning and 107.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 12:18:23,091 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.12ms. Allocated memory is still 125.8MB. Free memory was 86.9MB in the beginning and 86.8MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.63ms. Allocated memory is still 195.0MB. Free memory was 163.6MB in the beginning and 146.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.01ms. Allocated memory is still 195.0MB. Free memory was 146.0MB in the beginning and 141.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.37ms. Allocated memory is still 195.0MB. Free memory was 141.3MB in the beginning and 130.0MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 585.19ms. Allocated memory is still 195.0MB. Free memory was 130.0MB in the beginning and 158.6MB in the end (delta: -28.6MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8488.94ms. Allocated memory was 195.0MB in the beginning and 285.2MB in the end (delta: 90.2MB). Free memory was 157.6MB in the beginning and 108.2MB in the end (delta: 49.3MB). Peak memory consumption was 139.5MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 285.2MB. Free memory was 108.2MB in the beginning and 107.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryArithmeticFLOAToperation at line 134. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 200; [L23] unsigned short int var_1_5 = 42139; [L24] unsigned short int var_1_7 = 1; [L25] double var_1_9 = 0.1; [L26] float var_1_12 = 10000000000.5; [L27] float var_1_13 = 255.6; [L28] float var_1_14 = 128.2; [L29] signed long int var_1_15 = 500; [L30] unsigned char var_1_16 = 0; [L31] unsigned char var_1_17 = 0; [L32] unsigned char var_1_18 = 0; [L33] signed char var_1_19 = -5; [L34] signed char var_1_20 = -1; [L35] signed char var_1_21 = 8; [L36] float var_1_22 = 3.75; [L37] signed short int var_1_23 = 10; [L38] unsigned long int var_1_24 = 8; [L39] unsigned char var_1_25 = 5; [L40] unsigned char var_1_26 = 50; [L41] float var_1_27 = 4.5; [L42] unsigned short int var_1_28 = 5; [L43] unsigned long int var_1_29 = 50; [L44] double var_1_30 = 3.5; [L45] unsigned char var_1_31 = 1; [L46] float last_1_var_1_12 = 10000000000.5; [L47] signed short int last_1_var_1_23 = 10; [L48] unsigned long int last_1_var_1_24 = 8; [L49] unsigned char last_1_var_1_25 = 5; [L50] unsigned long int last_1_var_1_29 = 50; [L51] unsigned char last_1_var_1_31 = 1; [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L171] last_1_var_1_12 = var_1_12 [L172] last_1_var_1_23 = var_1_23 [L173] last_1_var_1_24 = var_1_24 [L174] last_1_var_1_25 = var_1_25 [L175] last_1_var_1_29 = var_1_29 [L176] last_1_var_1_31 = var_1_31 [L186] RET updateLastVariables() [L187] CALL updateVariables() [L144] var_1_5 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L145] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L146] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L146] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L147] var_1_9 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L148] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L149] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L149] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L151] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L152] var_1_14 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L153] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L154] var_1_17 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L155] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L156] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L156] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L157] var_1_18 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L158] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L159] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L159] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L160] var_1_20 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_20 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L161] RET assume_abort_if_not(var_1_20 >= -127) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L162] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L162] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L163] var_1_21 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L164] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L165] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L165] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L166] var_1_26 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L167] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L168] CALL assume_abort_if_not(var_1_26 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L168] RET assume_abort_if_not(var_1_26 <= 254) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L187] RET updateVariables() [L188] CALL step() [L55] unsigned short int stepLocal_1 = var_1_5; [L56] unsigned long int stepLocal_0 = (last_1_var_1_25 + last_1_var_1_23) + (last_1_var_1_29 / var_1_5); VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L57] COND FALSE !((last_1_var_1_12 / var_1_9) != last_1_var_1_12) [L76] var_1_7 = var_1_5 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L78] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L81] COND TRUE \read(var_1_17) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L82] COND FALSE !(((((var_1_29) > (var_1_5)) ? (var_1_29) : (var_1_5))) < ((((4) < 0 ) ? -(4) : (4)))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L86] var_1_19 = ((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) [L87] var_1_30 = var_1_14 [L88] var_1_31 = var_1_17 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L89] COND FALSE !(var_1_13 != 4.5f) [L96] var_1_16 = (var_1_18 || (! var_1_17)) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L98] COND TRUE var_1_16 || var_1_17 [L99] var_1_22 = ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L101] COND TRUE \read(var_1_31) [L102] var_1_25 = (4 + 8) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L106] COND TRUE var_1_13 != var_1_22 [L107] var_1_28 = var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L111] signed long int stepLocal_2 = ((((-64) < (var_1_28)) ? (-64) : (var_1_28))) + (var_1_25 << 1); VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, stepLocal_2=-40, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L112] COND TRUE stepLocal_2 < var_1_7 [L113] var_1_12 = (((((var_1_13 - 128.9f)) < (var_1_14)) ? ((var_1_13 - 128.9f)) : (var_1_14))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L115] COND FALSE !(\read(var_1_16)) [L118] var_1_1 = (((((var_1_5 - var_1_25)) < ((var_1_25 + (256 + 1)))) ? ((var_1_5 - var_1_25)) : ((var_1_25 + (256 + 1))))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L120] unsigned short int stepLocal_3 = var_1_5; VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, stepLocal_3=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L121] COND TRUE stepLocal_3 >= ((((var_1_25) < (var_1_7)) ? (var_1_25) : (var_1_7))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L122] COND TRUE ! var_1_16 [L123] var_1_15 = var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L126] COND FALSE !(var_1_16 || var_1_18) [L129] var_1_24 = ((((2u) > (100u)) ? (2u) : (100u))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L131] COND TRUE var_1_1 != var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L132] COND TRUE var_1_23 >= -128 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L133] COND TRUE var_1_30 != ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) [L134] var_1_27 = (var_1_13 - (99999.4f + 9.999999999125E9f)) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return ((((((((((((((var_1_16 ? (var_1_1 == ((unsigned short int) (((((var_1_25 + var_1_25)) < ((var_1_5 - ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))) ? ((var_1_25 + var_1_25)) : ((var_1_5 - ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_25)) < ((var_1_25 + (256 + 1)))) ? ((var_1_5 - var_1_25)) : ((var_1_25 + (256 + 1)))))))) && (((last_1_var_1_12 / var_1_9) != last_1_var_1_12) ? ((var_1_9 >= last_1_var_1_12) ? (var_1_7 == ((unsigned short int) last_1_var_1_25)) : ((var_1_5 <= last_1_var_1_25) ? ((last_1_var_1_25 < ((last_1_var_1_25 + last_1_var_1_23) + (last_1_var_1_29 / var_1_5))) ? (last_1_var_1_31 ? (var_1_7 == ((unsigned short int) 5)) : (var_1_7 == ((unsigned short int) last_1_var_1_25))) : (var_1_7 == ((unsigned short int) last_1_var_1_25))) : (var_1_7 == ((unsigned short int) last_1_var_1_25)))) : (var_1_7 == ((unsigned short int) var_1_5)))) && (((((((-64) < (var_1_28)) ? (-64) : (var_1_28))) + (var_1_25 << 1)) < var_1_7) ? (var_1_12 == ((float) (((((var_1_13 - 128.9f)) < (var_1_14)) ? ((var_1_13 - 128.9f)) : (var_1_14))))) : 1)) && ((var_1_5 >= ((((var_1_25) < (var_1_7)) ? (var_1_25) : (var_1_7)))) ? ((! var_1_16) ? (var_1_15 == ((signed long int) var_1_25)) : 1) : 1)) && ((var_1_13 != 4.5f) ? (var_1_31 ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) (! 0)))) : (var_1_16 == ((unsigned char) (var_1_18 || (! var_1_17)))))) && (var_1_19 == ((signed char) ((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))) && ((var_1_16 || var_1_17) ? (var_1_22 == ((float) ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))))) : 1)) && (var_1_17 ? ((((((var_1_29) > (var_1_5)) ? (var_1_29) : (var_1_5))) < ((((4) < 0 ) ? -(4) : (4)))) ? (var_1_23 == ((signed short int) var_1_20)) : 1) : 1)) && ((var_1_16 || var_1_18) ? (var_1_24 == ((unsigned long int) ((((last_1_var_1_24) > (var_1_25)) ? (last_1_var_1_24) : (var_1_25))))) : (var_1_24 == ((unsigned long int) ((((2u) > (100u)) ? (2u) : (100u))))))) && (var_1_31 ? (var_1_25 == ((unsigned char) (4 + 8))) : (var_1_25 == ((unsigned char) ((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))))) && ((var_1_1 != var_1_25) ? ((var_1_23 >= -128) ? ((var_1_30 != ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) ? (var_1_27 == ((float) (var_1_13 - (99999.4f + 9.999999999125E9f)))) : (var_1_27 == ((float) ((((0.8f) > (var_1_13)) ? (0.8f) : (var_1_13)))))) : 1) : (var_1_27 == ((float) var_1_14)))) && ((var_1_13 != var_1_22) ? (var_1_28 == ((unsigned short int) var_1_25)) : (var_1_28 == ((unsigned short int) (var_1_5 - 10))))) && (var_1_18 ? (var_1_29 == ((unsigned long int) (((((var_1_7 + 100000000u)) > (var_1_26)) ? ((var_1_7 + 100000000u)) : (var_1_26))))) : 1)) && (var_1_30 == ((double) var_1_14))) && (var_1_31 == ((unsigned char) var_1_17)) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 962 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 953 mSDsluCounter, 1952 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1077 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 978 IncrementalHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 875 mSDtfsCounter, 978 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 820 GetRequests, 760 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=3, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 282 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1441 NumberOfCodeBlocks, 1441 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1423 ConstructedInterpolants, 0 QuantifiedInterpolants, 4959 SizeOfPredicates, 6 NumberOfNonLiveVariables, 617 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 6042/6240 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 12:18:23,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-38.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 e4116054e7338e37f5204f84ea9d95032295044fbcd5b21bea8f2797dfdd1b8f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:18:25,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:18:25,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 12:18:25,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:18:25,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:18:25,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:18:25,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:18:25,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:18:25,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:18:25,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:18:25,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:18:25,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:18:25,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:18:25,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:18:25,353 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:18:25,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:18:25,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:18:25,354 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:18:25,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:18:25,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:18:25,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:18:25,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:18:25,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:18:25,359 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 12:18:25,359 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 12:18:25,359 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:18:25,359 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 12:18:25,360 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:18:25,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:18:25,360 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:18:25,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:18:25,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:18:25,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:18:25,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:18:25,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:18:25,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:18:25,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:18:25,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:18:25,362 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 12:18:25,362 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 12:18:25,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:18:25,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:18:25,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:18:25,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:18:25,365 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 12:18:25,365 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4116054e7338e37f5204f84ea9d95032295044fbcd5b21bea8f2797dfdd1b8f [2024-10-14 12:18:25,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:18:25,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:18:25,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:18:25,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:18:25,690 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:18:25,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-38.i [2024-10-14 12:18:27,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:18:27,345 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:18:27,346 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-38.i [2024-10-14 12:18:27,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c249b902b/d94eb65006e0425fbef9fcfb15a4f104/FLAGbe201b85d [2024-10-14 12:18:27,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c249b902b/d94eb65006e0425fbef9fcfb15a4f104 [2024-10-14 12:18:27,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:18:27,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:18:27,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:18:27,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:18:27,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:18:27,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:18:27" (1/1) ... [2024-10-14 12:18:27,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44ccca61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27, skipping insertion in model container [2024-10-14 12:18:27,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:18:27" (1/1) ... [2024-10-14 12:18:27,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:18:27,556 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-38.i[916,929] [2024-10-14 12:18:27,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:18:27,648 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:18:27,663 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-38.i[916,929] [2024-10-14 12:18:27,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:18:27,747 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:18:27,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27 WrapperNode [2024-10-14 12:18:27,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:18:27,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:18:27,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:18:27,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:18:27,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27" (1/1) ... [2024-10-14 12:18:27,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27" (1/1) ... [2024-10-14 12:18:27,812 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-10-14 12:18:27,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:18:27,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:18:27,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:18:27,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:18:27,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27" (1/1) ... [2024-10-14 12:18:27,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27" (1/1) ... [2024-10-14 12:18:27,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27" (1/1) ... [2024-10-14 12:18:27,851 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 12:18:27,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27" (1/1) ... [2024-10-14 12:18:27,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27" (1/1) ... [2024-10-14 12:18:27,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27" (1/1) ... [2024-10-14 12:18:27,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27" (1/1) ... [2024-10-14 12:18:27,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27" (1/1) ... [2024-10-14 12:18:27,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27" (1/1) ... [2024-10-14 12:18:27,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:18:27,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:18:27,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:18:27,886 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:18:27,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27" (1/1) ... [2024-10-14 12:18:27,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:18:27,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:18:27,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 12:18:27,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 12:18:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:18:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 12:18:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:18:27,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:18:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:18:27,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:18:28,066 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:18:28,068 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:18:42,588 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-14 12:18:42,588 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:18:42,643 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:18:42,644 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:18:42,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:18:42 BoogieIcfgContainer [2024-10-14 12:18:42,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:18:42,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:18:42,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:18:42,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:18:42,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:18:27" (1/3) ... [2024-10-14 12:18:42,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9dbd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:18:42, skipping insertion in model container [2024-10-14 12:18:42,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:18:27" (2/3) ... [2024-10-14 12:18:42,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9dbd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:18:42, skipping insertion in model container [2024-10-14 12:18:42,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:18:42" (3/3) ... [2024-10-14 12:18:42,653 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-38.i [2024-10-14 12:18:42,670 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:18:42,670 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:18:42,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:18:42,755 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;@7046e8f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:18:42,756 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:18:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 44 states have internal predecessors, (69), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:18:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 12:18:42,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:18:42,772 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:18:42,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:18:42,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:18:42,779 INFO L85 PathProgramCache]: Analyzing trace with hash 45234567, now seen corresponding path program 1 times [2024-10-14 12:18:42,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:18:42,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656133415] [2024-10-14 12:18:42,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:42,794 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 [2024-10-14 12:18:42,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:18:42,797 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) [2024-10-14 12:18:42,810 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 [2024-10-14 12:18:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:43,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 12:18:43,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:18:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-14 12:18:43,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:18:43,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:18:43,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656133415] [2024-10-14 12:18:43,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656133415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:18:43,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:18:43,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:18:43,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209756267] [2024-10-14 12:18:43,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:18:43,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:18:43,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:18:43,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:18:43,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:18:43,843 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 44 states have internal predecessors, (69), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 12:18:45,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:18:49,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:18:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:18:49,950 INFO L93 Difference]: Finished difference Result 121 states and 216 transitions. [2024-10-14 12:18:50,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:18:50,157 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 109 [2024-10-14 12:18:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:18:50,163 INFO L225 Difference]: With dead ends: 121 [2024-10-14 12:18:50,163 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 12:18:50,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:18:50,168 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:18:50,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2024-10-14 12:18:50,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 12:18:50,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-14 12:18:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 42 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:18:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 96 transitions. [2024-10-14 12:18:50,203 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 96 transitions. Word has length 109 [2024-10-14 12:18:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:18:50,203 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 96 transitions. [2024-10-14 12:18:50,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 12:18:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 96 transitions. [2024-10-14 12:18:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 12:18:50,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:18:50,210 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:18:50,248 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 [2024-10-14 12:18:50,411 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 [2024-10-14 12:18:50,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:18:50,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:18:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash -111892277, now seen corresponding path program 1 times [2024-10-14 12:18:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:18:50,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689994622] [2024-10-14 12:18:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:18:50,414 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 [2024-10-14 12:18:50,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:18:50,417 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) [2024-10-14 12:18:50,418 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 [2024-10-14 12:18:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:18:51,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 12:18:51,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:18:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 249 proven. 18 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2024-10-14 12:18:53,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 12:18:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 27 proven. 18 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-14 12:18:56,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:18:56,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689994622] [2024-10-14 12:18:56,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689994622] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 12:18:56,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 12:18:56,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-14 12:18:56,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184896284] [2024-10-14 12:18:56,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 12:18:56,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 12:18:56,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:18:56,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 12:18:56,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:18:56,959 INFO L87 Difference]: Start difference. First operand 60 states and 96 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 12:19:04,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:19:08,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:19:12,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:19:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:19:12,883 INFO L93 Difference]: Finished difference Result 127 states and 198 transitions. [2024-10-14 12:19:13,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 12:19:13,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 109 [2024-10-14 12:19:13,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:19:13,134 INFO L225 Difference]: With dead ends: 127 [2024-10-14 12:19:13,134 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 12:19:13,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-14 12:19:13,136 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 116 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2024-10-14 12:19:13,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 178 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 15.2s Time] [2024-10-14 12:19:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 12:19:13,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2024-10-14 12:19:13,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:19:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 98 transitions. [2024-10-14 12:19:13,148 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 98 transitions. Word has length 109 [2024-10-14 12:19:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:19:13,149 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 98 transitions. [2024-10-14 12:19:13,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 12:19:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 98 transitions. [2024-10-14 12:19:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 12:19:13,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:19:13,151 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:19:13,186 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 (3)] Ended with exit code 0 [2024-10-14 12:19:13,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 [2024-10-14 12:19:13,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:19:13,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:19:13,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1700240179, now seen corresponding path program 1 times [2024-10-14 12:19:13,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:19:13,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116082963] [2024-10-14 12:19:13,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:19:13,358 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 [2024-10-14 12:19:13,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:19:13,363 INFO L229 MonitoredProcess]: Starting monitored process 4 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) [2024-10-14 12:19:13,367 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 (4)] Waiting until timeout for monitored process [2024-10-14 12:19:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:19:14,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 12:19:14,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:19:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 243 proven. 27 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-10-14 12:19:17,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 12:19:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-14 12:19:20,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:19:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116082963] [2024-10-14 12:19:20,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116082963] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 12:19:20,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 12:19:20,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-14 12:19:20,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658812189] [2024-10-14 12:19:20,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 12:19:20,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 12:19:20,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:19:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 12:19:20,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:19:20,730 INFO L87 Difference]: Start difference. First operand 64 states and 98 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 12:19:21,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:19:29,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:19:33,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:19:37,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:19:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:19:39,107 INFO L93 Difference]: Finished difference Result 146 states and 219 transitions. [2024-10-14 12:19:39,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 12:19:39,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 109 [2024-10-14 12:19:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:19:39,110 INFO L225 Difference]: With dead ends: 146 [2024-10-14 12:19:39,110 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 12:19:39,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-14 12:19:39,112 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 154 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2024-10-14 12:19:39,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 194 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 160 Invalid, 3 Unknown, 0 Unchecked, 17.8s Time] [2024-10-14 12:19:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 12:19:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2024-10-14 12:19:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 53 states have internal predecessors, (71), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 12:19:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 115 transitions. [2024-10-14 12:19:39,126 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 115 transitions. Word has length 109 [2024-10-14 12:19:39,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:19:39,127 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 115 transitions. [2024-10-14 12:19:39,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 12:19:39,128 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2024-10-14 12:19:39,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 12:19:39,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:19:39,131 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:19:39,162 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 (4)] Ended with exit code 0 [2024-10-14 12:19:39,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 [2024-10-14 12:19:39,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:19:39,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:19:39,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2077654749, now seen corresponding path program 1 times [2024-10-14 12:19:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:19:39,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082453835] [2024-10-14 12:19:39,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:19:39,333 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 [2024-10-14 12:19:39,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:19:39,336 INFO L229 MonitoredProcess]: Starting monitored process 5 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) [2024-10-14 12:19:39,337 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 (5)] Waiting until timeout for monitored process [2024-10-14 12:19:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:19:40,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 12:19:40,192 INFO L278 TraceCheckSpWp]: Computing forward predicates...