./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_floatingpointinfluence_has-floats_file-6.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_floatingpointinfluence_has-floats_file-6.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 d73169866977dcaccdece02ee66e85657451dd2678c2f9b97d40486db7899feb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:55:34,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:55:35,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:55:35,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:55:35,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:55:35,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:55:35,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:55:35,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:55:35,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:55:35,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:55:35,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:55:35,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:55:35,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:55:35,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:55:35,078 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:55:35,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:55:35,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:55:35,079 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:55:35,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:55:35,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:55:35,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:55:35,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:55:35,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:55:35,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:55:35,081 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:55:35,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:55:35,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:55:35,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:55:35,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:55:35,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:55:35,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:55:35,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:55:35,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:55:35,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:55:35,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:55:35,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:55:35,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:55:35,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:55:35,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:55:35,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:55:35,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:55:35,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:55:35,087 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 -> d73169866977dcaccdece02ee66e85657451dd2678c2f9b97d40486db7899feb [2024-10-14 10:55:35,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:55:35,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:55:35,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:55:35,375 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:55:35,375 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:55:35,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i [2024-10-14 10:55:36,881 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:55:37,073 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:55:37,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i [2024-10-14 10:55:37,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87560e6da/06c5aae83296402cbd6719825573499c/FLAG4215e30b1 [2024-10-14 10:55:37,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87560e6da/06c5aae83296402cbd6719825573499c [2024-10-14 10:55:37,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:55:37,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:55:37,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:55:37,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:55:37,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:55:37,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:55:37" (1/1) ... [2024-10-14 10:55:37,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28bf5ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37, skipping insertion in model container [2024-10-14 10:55:37,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:55:37" (1/1) ... [2024-10-14 10:55:37,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:55:37,295 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_floatingpointinfluence_has-floats_file-6.i[916,929] [2024-10-14 10:55:37,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:55:37,358 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:55:37,369 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_floatingpointinfluence_has-floats_file-6.i[916,929] [2024-10-14 10:55:37,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:55:37,411 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:55:37,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37 WrapperNode [2024-10-14 10:55:37,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:55:37,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:55:37,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:55:37,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:55:37,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37" (1/1) ... [2024-10-14 10:55:37,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37" (1/1) ... [2024-10-14 10:55:37,484 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-10-14 10:55:37,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:55:37,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:55:37,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:55:37,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:55:37,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37" (1/1) ... [2024-10-14 10:55:37,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37" (1/1) ... [2024-10-14 10:55:37,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37" (1/1) ... [2024-10-14 10:55:37,526 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 10:55:37,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37" (1/1) ... [2024-10-14 10:55:37,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37" (1/1) ... [2024-10-14 10:55:37,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37" (1/1) ... [2024-10-14 10:55:37,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37" (1/1) ... [2024-10-14 10:55:37,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37" (1/1) ... [2024-10-14 10:55:37,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37" (1/1) ... [2024-10-14 10:55:37,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:55:37,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:55:37,554 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:55:37,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:55:37,555 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37" (1/1) ... [2024-10-14 10:55:37,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:55:37,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:55:37,587 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 10:55:37,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 10:55:37,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:55:37,631 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:55:37,632 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:55:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:55:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:55:37,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:55:37,817 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:55:37,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:55:38,098 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 10:55:38,099 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:55:38,153 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:55:38,154 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:55:38,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:55:38 BoogieIcfgContainer [2024-10-14 10:55:38,155 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:55:38,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:55:38,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:55:38,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:55:38,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:55:37" (1/3) ... [2024-10-14 10:55:38,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4431dded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:55:38, skipping insertion in model container [2024-10-14 10:55:38,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:55:37" (2/3) ... [2024-10-14 10:55:38,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4431dded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:55:38, skipping insertion in model container [2024-10-14 10:55:38,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:55:38" (3/3) ... [2024-10-14 10:55:38,166 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-6.i [2024-10-14 10:55:38,180 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:55:38,180 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:55:38,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:55:38,235 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;@6bc3d0fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:55:38,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:55:38,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 10:55:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 10:55:38,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:55:38,255 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:55:38,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:55:38,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:55:38,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1272058833, now seen corresponding path program 1 times [2024-10-14 10:55:38,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:55:38,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933445518] [2024-10-14 10:55:38,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:55:38,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:55:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:55:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:55:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:55:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:55:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:55:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:55:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:55:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:55:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:55:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:55:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:55:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:55:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:55:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:55:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:55:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:55:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:55:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:55:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:55:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 10:55:38,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:55:38,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933445518] [2024-10-14 10:55:38,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933445518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:55:38,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:55:38,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:55:38,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481159264] [2024-10-14 10:55:38,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:55:38,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:55:38,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:55:38,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:55:38,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:55:38,708 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 10:55:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:55:38,754 INFO L93 Difference]: Finished difference Result 97 states and 171 transitions. [2024-10-14 10:55:38,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:55:38,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2024-10-14 10:55:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:55:38,763 INFO L225 Difference]: With dead ends: 97 [2024-10-14 10:55:38,763 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 10:55:38,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 10:55:38,770 INFO L432 NwaCegarLoop]: 69 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, 69 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 10:55:38,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:55:38,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 10:55:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-14 10:55:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 10:55:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2024-10-14 10:55:38,821 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 116 [2024-10-14 10:55:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:55:38,822 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 72 transitions. [2024-10-14 10:55:38,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 10:55:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2024-10-14 10:55:38,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 10:55:38,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:55:38,828 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:55:38,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:55:38,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:55:38,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:55:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1051369125, now seen corresponding path program 1 times [2024-10-14 10:55:38,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:55:38,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981812821] [2024-10-14 10:55:38,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:55:38,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:55:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:55:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:55:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:55:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:55:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:55:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:55:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:55:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:55:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:55:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:55:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:55:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:55:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:55:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:55:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:55:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:55:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:55:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:55:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:55:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 10:55:39,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:55:39,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981812821] [2024-10-14 10:55:39,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981812821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:55:39,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:55:39,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:55:39,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991439103] [2024-10-14 10:55:39,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:55:39,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:55:39,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:55:39,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:55:39,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:55:39,453 INFO L87 Difference]: Start difference. First operand 48 states and 72 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:55:39,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:55:39,569 INFO L93 Difference]: Finished difference Result 95 states and 143 transitions. [2024-10-14 10:55:39,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:55:39,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2024-10-14 10:55:39,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:55:39,572 INFO L225 Difference]: With dead ends: 95 [2024-10-14 10:55:39,572 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 10:55:39,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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 10:55:39,574 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:55:39,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 67 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:55:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 10:55:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-14 10:55:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 10:55:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-10-14 10:55:39,586 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 116 [2024-10-14 10:55:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:55:39,587 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-10-14 10:55:39,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:55:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-10-14 10:55:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 10:55:39,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:55:39,590 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:55:39,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:55:39,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:55:39,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:55:39,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1108627427, now seen corresponding path program 1 times [2024-10-14 10:55:39,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:55:39,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441956842] [2024-10-14 10:55:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:55:39,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:55:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:55:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:55:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:55:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:55:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:55:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:55:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:55:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:55:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:55:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:55:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:55:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:55:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:55:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:55:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:55:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:55:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:55:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:55:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:55:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 10:55:39,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:55:39,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441956842] [2024-10-14 10:55:39,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441956842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:55:39,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:55:39,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:55:39,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885435116] [2024-10-14 10:55:39,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:55:39,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:55:39,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:55:39,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:55:39,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:55:39,864 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:55:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:55:39,914 INFO L93 Difference]: Finished difference Result 128 states and 187 transitions. [2024-10-14 10:55:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:55:39,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2024-10-14 10:55:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:55:39,917 INFO L225 Difference]: With dead ends: 128 [2024-10-14 10:55:39,917 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 10:55:39,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 10:55:39,921 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 44 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:55:39,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 160 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:55:39,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 10:55:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2024-10-14 10:55:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.2) internal successors, (54), 46 states have internal predecessors, (54), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 10:55:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2024-10-14 10:55:39,953 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 116 [2024-10-14 10:55:39,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:55:39,954 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2024-10-14 10:55:39,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:55:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2024-10-14 10:55:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 10:55:39,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:55:39,958 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:55:39,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:55:39,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:55:39,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:55:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1411332507, now seen corresponding path program 1 times [2024-10-14 10:55:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:55:39,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606443287] [2024-10-14 10:55:39,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:55:39,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:55:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:55:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:55:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:55:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:55:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:55:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:55:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:55:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:55:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:55:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:55:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:55:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:55:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:55:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:55:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:55:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:55:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:55:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:55:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:55:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 10:55:49,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:55:49,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606443287] [2024-10-14 10:55:49,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606443287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:55:49,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:55:49,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 10:55:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134405432] [2024-10-14 10:55:49,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:55:49,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:55:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:55:49,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:55:49,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:55:49,853 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:55:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:55:55,140 INFO L93 Difference]: Finished difference Result 164 states and 235 transitions. [2024-10-14 10:55:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 10:55:55,141 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2024-10-14 10:55:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:55:55,145 INFO L225 Difference]: With dead ends: 164 [2024-10-14 10:55:55,146 INFO L226 Difference]: Without dead ends: 162 [2024-10-14 10:55:55,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-14 10:55:55,148 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 64 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 10:55:55,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 238 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 10:55:55,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-14 10:55:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2024-10-14 10:55:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 90 states have (on average 1.2) internal successors, (108), 92 states have internal predecessors, (108), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 10:55:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 228 transitions. [2024-10-14 10:55:55,185 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 228 transitions. Word has length 116 [2024-10-14 10:55:55,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:55:55,186 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 228 transitions. [2024-10-14 10:55:55,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:55:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 228 transitions. [2024-10-14 10:55:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 10:55:55,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:55:55,188 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:55:55,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:55:55,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:55:55,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:55:55,189 INFO L85 PathProgramCache]: Analyzing trace with hash 202460211, now seen corresponding path program 1 times [2024-10-14 10:55:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:55:55,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11039261] [2024-10-14 10:55:55,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:55:55,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:55:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:55:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:55:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:55:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:55:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:55:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:55:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:55:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:55:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:55:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:55:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:55:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:55:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:55:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:55:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:55:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:55:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:55:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:55:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:55:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:55:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 10:55:58,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:55:58,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11039261] [2024-10-14 10:55:58,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11039261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:55:58,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:55:58,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 10:55:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821636711] [2024-10-14 10:55:58,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:55:58,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:55:58,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:55:58,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:55:58,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:55:58,058 INFO L87 Difference]: Start difference. First operand 155 states and 228 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:55:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:55:58,706 INFO L93 Difference]: Finished difference Result 194 states and 275 transitions. [2024-10-14 10:55:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 10:55:58,708 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2024-10-14 10:55:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:55:58,710 INFO L225 Difference]: With dead ends: 194 [2024-10-14 10:55:58,710 INFO L226 Difference]: Without dead ends: 192 [2024-10-14 10:55:58,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 10:55:58,712 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 67 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:55:58,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 293 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 10:55:58,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-14 10:55:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2024-10-14 10:55:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 99 states have internal predecessors, (118), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 10:55:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2024-10-14 10:55:58,747 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 117 [2024-10-14 10:55:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:55:58,748 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2024-10-14 10:55:58,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:55:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2024-10-14 10:55:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 10:55:58,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:55:58,750 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:55:58,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 10:55:58,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:55:58,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:55:58,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1977467573, now seen corresponding path program 1 times [2024-10-14 10:55:58,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:55:58,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512986193] [2024-10-14 10:55:58,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:55:58,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:55:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:56:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:56:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:56:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:56:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:56:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:56:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:56:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:56:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:56:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:56:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:56:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:56:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:56:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:56:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 10:56:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:56:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:56:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:56:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:56:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 10:56:02,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:56:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512986193] [2024-10-14 10:56:02,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512986193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:56:02,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:56:02,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 10:56:02,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920737713] [2024-10-14 10:56:02,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:56:02,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 10:56:02,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:56:02,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 10:56:02,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 10:56:02,958 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:56:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:56:04,451 INFO L93 Difference]: Finished difference Result 183 states and 259 transitions. [2024-10-14 10:56:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 10:56:04,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2024-10-14 10:56:04,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:56:04,456 INFO L225 Difference]: With dead ends: 183 [2024-10-14 10:56:04,456 INFO L226 Difference]: Without dead ends: 181 [2024-10-14 10:56:04,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-14 10:56:04,458 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 80 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 10:56:04,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 297 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 10:56:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-14 10:56:04,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 167. [2024-10-14 10:56:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 102 states have (on average 1.2156862745098038) internal successors, (124), 104 states have internal predecessors, (124), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 10:56:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 244 transitions. [2024-10-14 10:56:04,496 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 244 transitions. Word has length 117 [2024-10-14 10:56:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:56:04,496 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 244 transitions. [2024-10-14 10:56:04,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:56:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2024-10-14 10:56:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 10:56:04,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:56:04,498 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:56:04,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 10:56:04,499 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:56:04,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:56:04,499 INFO L85 PathProgramCache]: Analyzing trace with hash -606886415, now seen corresponding path program 1 times [2024-10-14 10:56:04,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:56:04,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017981864] [2024-10-14 10:56:04,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:56:04,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:56:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:56:04,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1419062837] [2024-10-14 10:56:04,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:56:04,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:56:04,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:56:04,562 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 10:56:04,563 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 10:56:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:56:04,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:56:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:56:05,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:56:05,181 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:56:05,182 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:56:05,203 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 10:56:05,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:56:05,388 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:56:05,474 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:56:05,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:56:05 BoogieIcfgContainer [2024-10-14 10:56:05,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:56:05,479 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:56:05,479 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:56:05,479 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:56:05,480 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:55:38" (3/4) ... [2024-10-14 10:56:05,482 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:56:05,483 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:56:05,485 INFO L158 Benchmark]: Toolchain (without parser) took 28382.48ms. Allocated memory was 165.7MB in the beginning and 262.1MB in the end (delta: 96.5MB). Free memory was 97.7MB in the beginning and 131.7MB in the end (delta: -33.9MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2024-10-14 10:56:05,485 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 113.2MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:56:05,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.79ms. Allocated memory is still 165.7MB. Free memory was 97.5MB in the beginning and 83.9MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 10:56:05,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.15ms. Allocated memory is still 165.7MB. Free memory was 83.7MB in the beginning and 81.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 10:56:05,487 INFO L158 Benchmark]: Boogie Preprocessor took 62.46ms. Allocated memory is still 165.7MB. Free memory was 81.0MB in the beginning and 77.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 10:56:05,488 INFO L158 Benchmark]: RCFGBuilder took 602.57ms. Allocated memory is still 165.7MB. Free memory was 77.6MB in the beginning and 120.4MB in the end (delta: -42.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 10:56:05,488 INFO L158 Benchmark]: TraceAbstraction took 27319.47ms. Allocated memory was 165.7MB in the beginning and 262.1MB in the end (delta: 96.5MB). Free memory was 119.6MB in the beginning and 132.7MB in the end (delta: -13.1MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2024-10-14 10:56:05,488 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 262.1MB. Free memory was 132.7MB in the beginning and 131.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:56:05,491 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.38ms. Allocated memory is still 113.2MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.79ms. Allocated memory is still 165.7MB. Free memory was 97.5MB in the beginning and 83.9MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.15ms. Allocated memory is still 165.7MB. Free memory was 83.7MB in the beginning and 81.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.46ms. Allocated memory is still 165.7MB. Free memory was 81.0MB in the beginning and 77.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 602.57ms. Allocated memory is still 165.7MB. Free memory was 77.6MB in the beginning and 120.4MB in the end (delta: -42.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27319.47ms. Allocated memory was 165.7MB in the beginning and 262.1MB in the end (delta: 96.5MB). Free memory was 119.6MB in the beginning and 132.7MB in the end (delta: -13.1MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 262.1MB. Free memory was 132.7MB in the beginning and 131.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 0; [L23] unsigned short int var_1_4 = 32; [L24] unsigned short int var_1_6 = 10; [L25] signed long int var_1_7 = 4; [L26] signed long int var_1_8 = 2; [L27] double var_1_9 = 0.0; [L28] double var_1_10 = 64.2; [L29] double var_1_11 = 0.0; [L30] double var_1_12 = 0.25; [L31] unsigned short int var_1_13 = 36833; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] signed long int var_1_18 = -32; [L36] unsigned long int var_1_20 = 50; [L37] unsigned long int var_1_21 = 2655070710; [L38] unsigned char last_1_var_1_14 = 0; [L39] signed long int last_1_var_1_18 = -32; [L40] unsigned long int last_1_var_1_20 = 50; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L101] last_1_var_1_14 = var_1_14 [L102] last_1_var_1_18 = var_1_18 [L103] last_1_var_1_20 = var_1_20 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L69] var_1_4 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L71] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L72] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L74] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_7 <= 17) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 <= 17) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L76] var_1_8 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16, var_1_9=0] [L77] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_8 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 <= 16) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16, var_1_9=0] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= 4611686.018427387900e+12F && 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_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L80] RET assume_abort_if_not((var_1_9 >= 4611686.018427387900e+12F && 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_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427387900e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L82] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427387900e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L84] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L85] var_1_12 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L86] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L87] var_1_13 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L88] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L89] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L89] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L90] var_1_16 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L91] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L92] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L92] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L93] var_1_17 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L94] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L95] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L95] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L96] var_1_21 = __VERIFIER_nondet_ulong() [L97] CALL assume_abort_if_not(var_1_21 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-534723428353, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-534723428353, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L97] RET assume_abort_if_not(var_1_21 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-534723428353, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L98] CALL assume_abort_if_not(var_1_21 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-534723428353, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-534723428353, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L98] RET assume_abort_if_not(var_1_21 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-534723428353, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L114] RET updateVariables() [L115] CALL step() [L44] COND TRUE (var_1_4 - last_1_var_1_20) == last_1_var_1_18 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-534723428353, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L45] COND FALSE !(((var_1_9 - var_1_10) - var_1_11) > var_1_12) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-534723428353, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L51] COND TRUE var_1_13 > var_1_6 [L52] var_1_18 = (((((var_1_6) < (var_1_13)) ? (var_1_6) : (var_1_13))) - var_1_6) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=-534723428353, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L54] COND FALSE !(\read(last_1_var_1_14)) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=-534723428353, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L57] var_1_20 = ((((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) < ((var_1_21 - var_1_7))) ? (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) : ((var_1_21 - var_1_7)))) [L58] unsigned long int stepLocal_1 = var_1_20; [L59] unsigned long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, stepLocal_0=50, stepLocal_1=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=-534723428353, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L60] COND FALSE !((((((var_1_18) > (var_1_18)) ? (var_1_18) : (var_1_18))) / var_1_4) > stepLocal_1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, stepLocal_0=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=-534723428353, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return ((((((((((var_1_18) > (var_1_18)) ? (var_1_18) : (var_1_18))) / var_1_4) > var_1_20) ? ((var_1_20 == var_1_18) ? (var_1_1 == ((unsigned long int) 1000000000u)) : (var_1_1 == ((unsigned long int) 128u))) : 1) && (((var_1_4 - last_1_var_1_20) == last_1_var_1_18) ? ((((var_1_9 - var_1_10) - var_1_11) > var_1_12) ? (var_1_6 == ((unsigned short int) (var_1_13 - var_1_8))) : 1) : (var_1_6 == ((unsigned short int) var_1_13)))) && (last_1_var_1_14 ? (var_1_14 == ((unsigned char) (var_1_16 && var_1_17))) : 1)) && ((var_1_13 > var_1_6) ? (var_1_18 == ((signed long int) (((((var_1_6) < (var_1_13)) ? (var_1_6) : (var_1_13))) - var_1_6))) : 1)) && (var_1_20 == ((unsigned long int) ((((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) < ((var_1_21 - var_1_7))) ? (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) : ((var_1_21 - var_1_7)))))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=-534723428353, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=131070, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=-534723428353, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.2s, OverallIterations: 7, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 305 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 305 mSDsluCounter, 1124 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 684 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 688 IncrementalHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 440 mSDtfsCounter, 688 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=6, InterpolantAutomatonStates: 36, 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, 6 MinimizatonAttempts, 54 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 932 NumberOfCodeBlocks, 932 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 4629 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 4104/4104 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 10:56:05,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_floatingpointinfluence_has-floats_file-6.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 d73169866977dcaccdece02ee66e85657451dd2678c2f9b97d40486db7899feb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:56:07,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:56:07,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:56:07,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:56:07,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:56:07,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:56:07,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:56:07,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:56:07,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:56:07,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:56:07,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:56:07,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:56:07,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:56:07,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:56:07,748 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:56:07,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:56:07,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:56:07,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:56:07,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:56:07,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:56:07,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:56:07,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:56:07,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:56:07,754 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:56:07,755 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:56:07,755 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:56:07,755 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:56:07,755 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:56:07,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:56:07,756 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:56:07,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:56:07,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:56:07,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:56:07,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:56:07,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:56:07,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:56:07,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:56:07,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:56:07,759 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:56:07,759 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:56:07,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:56:07,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:56:07,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:56:07,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:56:07,761 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:56:07,761 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 -> d73169866977dcaccdece02ee66e85657451dd2678c2f9b97d40486db7899feb [2024-10-14 10:56:08,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:56:08,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:56:08,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:56:08,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:56:08,106 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:56:08,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i [2024-10-14 10:56:09,675 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:56:09,872 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:56:09,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i [2024-10-14 10:56:09,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9470998f1/4af1e14502a5488bbea883b3049929bd/FLAG448523e41 [2024-10-14 10:56:10,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9470998f1/4af1e14502a5488bbea883b3049929bd [2024-10-14 10:56:10,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:56:10,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:56:10,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:56:10,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:56:10,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:56:10,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:56:10" (1/1) ... [2024-10-14 10:56:10,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd1393b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10, skipping insertion in model container [2024-10-14 10:56:10,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:56:10" (1/1) ... [2024-10-14 10:56:10,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:56:10,451 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_floatingpointinfluence_has-floats_file-6.i[916,929] [2024-10-14 10:56:10,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:56:10,528 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:56:10,543 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_floatingpointinfluence_has-floats_file-6.i[916,929] [2024-10-14 10:56:10,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:56:10,598 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:56:10,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10 WrapperNode [2024-10-14 10:56:10,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:56:10,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:56:10,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:56:10,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:56:10,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10" (1/1) ... [2024-10-14 10:56:10,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10" (1/1) ... [2024-10-14 10:56:10,656 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-10-14 10:56:10,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:56:10,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:56:10,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:56:10,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:56:10,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10" (1/1) ... [2024-10-14 10:56:10,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10" (1/1) ... [2024-10-14 10:56:10,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10" (1/1) ... [2024-10-14 10:56:10,687 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 10:56:10,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10" (1/1) ... [2024-10-14 10:56:10,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10" (1/1) ... [2024-10-14 10:56:10,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10" (1/1) ... [2024-10-14 10:56:10,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10" (1/1) ... [2024-10-14 10:56:10,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10" (1/1) ... [2024-10-14 10:56:10,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10" (1/1) ... [2024-10-14 10:56:10,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:56:10,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:56:10,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:56:10,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:56:10,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10" (1/1) ... [2024-10-14 10:56:10,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:56:10,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:56:10,765 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 10:56:10,771 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 10:56:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:56:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:56:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:56:10,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:56:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:56:10,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:56:10,902 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:56:10,904 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:56:12,479 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 10:56:12,479 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:56:12,527 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:56:12,527 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:56:12,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:56:12 BoogieIcfgContainer [2024-10-14 10:56:12,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:56:12,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:56:12,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:56:12,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:56:12,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:56:10" (1/3) ... [2024-10-14 10:56:12,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb25f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:56:12, skipping insertion in model container [2024-10-14 10:56:12,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:56:10" (2/3) ... [2024-10-14 10:56:12,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb25f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:56:12, skipping insertion in model container [2024-10-14 10:56:12,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:56:12" (3/3) ... [2024-10-14 10:56:12,535 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-6.i [2024-10-14 10:56:12,551 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:56:12,551 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:56:12,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:56:12,636 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;@7ddbcaac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:56:12,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:56:12,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 10:56:12,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 10:56:12,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:56:12,652 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:56:12,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:56:12,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:56:12,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1272058833, now seen corresponding path program 1 times [2024-10-14 10:56:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:56:12,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005445067] [2024-10-14 10:56:12,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:56:12,668 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 10:56:12,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:56:12,673 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 10:56:12,675 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 10:56:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:12,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:56:12,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:56:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-10-14 10:56:13,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:56:13,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:56:13,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005445067] [2024-10-14 10:56:13,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005445067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:56:13,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:56:13,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:56:13,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634334758] [2024-10-14 10:56:13,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:56:13,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:56:13,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:56:13,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:56:13,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:56:13,069 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 10:56:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:56:13,477 INFO L93 Difference]: Finished difference Result 97 states and 171 transitions. [2024-10-14 10:56:13,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:56:13,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2024-10-14 10:56:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:56:13,510 INFO L225 Difference]: With dead ends: 97 [2024-10-14 10:56:13,510 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 10:56:13,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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 10:56:13,519 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:56:13,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 10:56:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 10:56:13,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-14 10:56:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 10:56:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2024-10-14 10:56:13,560 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 116 [2024-10-14 10:56:13,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:56:13,561 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 72 transitions. [2024-10-14 10:56:13,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 10:56:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2024-10-14 10:56:13,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 10:56:13,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:56:13,564 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:56:13,575 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 10:56:13,765 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 10:56:13,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:56:13,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:56:13,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1051369125, now seen corresponding path program 1 times [2024-10-14 10:56:13,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:56:13,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720802161] [2024-10-14 10:56:13,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:56:13,769 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 10:56:13,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:56:13,771 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 10:56:13,773 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 10:56:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:14,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 10:56:14,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:56:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 10:56:14,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:56:14,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:56:14,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720802161] [2024-10-14 10:56:14,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720802161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:56:14,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:56:14,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:56:14,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151777] [2024-10-14 10:56:14,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:56:14,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:56:14,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:56:14,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:56:14,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:56:14,112 INFO L87 Difference]: Start difference. First operand 48 states and 72 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:56:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:56:15,213 INFO L93 Difference]: Finished difference Result 128 states and 190 transitions. [2024-10-14 10:56:15,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:56:15,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2024-10-14 10:56:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:56:15,218 INFO L225 Difference]: With dead ends: 128 [2024-10-14 10:56:15,218 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 10:56:15,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 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 10:56:15,221 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 45 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:56:15,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 162 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 10:56:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 10:56:15,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2024-10-14 10:56:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 46 states have internal predecessors, (56), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 10:56:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2024-10-14 10:56:15,263 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 116 [2024-10-14 10:56:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:56:15,264 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2024-10-14 10:56:15,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:56:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2024-10-14 10:56:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 10:56:15,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:56:15,268 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:56:15,280 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 10:56:15,468 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 10:56:15,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:56:15,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:56:15,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1468590809, now seen corresponding path program 1 times [2024-10-14 10:56:15,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:56:15,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015590399] [2024-10-14 10:56:15,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:56:15,471 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 10:56:15,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:56:15,474 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 10:56:15,475 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 10:56:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:15,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 10:56:15,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:56:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 10:56:16,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:56:16,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:56:16,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015590399] [2024-10-14 10:56:16,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015590399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:56:16,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:56:16,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:56:16,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473717209] [2024-10-14 10:56:16,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:56:16,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:56:16,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:56:16,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:56:16,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:56:16,079 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:56:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:56:17,021 INFO L93 Difference]: Finished difference Result 155 states and 231 transitions. [2024-10-14 10:56:17,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:56:17,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2024-10-14 10:56:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:56:17,047 INFO L225 Difference]: With dead ends: 155 [2024-10-14 10:56:17,047 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 10:56:17,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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 10:56:17,051 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 10:56:17,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 67 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 10:56:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 10:56:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 10:56:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.2) internal successors, (54), 46 states have internal predecessors, (54), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 10:56:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2024-10-14 10:56:17,070 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 116 [2024-10-14 10:56:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:56:17,071 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2024-10-14 10:56:17,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:56:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2024-10-14 10:56:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 10:56:17,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:56:17,073 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:56:17,087 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 10:56:17,274 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 10:56:17,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:56:17,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:56:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1411332507, now seen corresponding path program 1 times [2024-10-14 10:56:17,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:56:17,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984889861] [2024-10-14 10:56:17,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:56:17,276 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 10:56:17,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:56:17,279 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 10:56:17,280 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 10:56:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:56:17,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 10:56:17,507 INFO L278 TraceCheckSpWp]: Computing forward predicates...