./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_no-floats_file-95.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_no-floats_file-95.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 71fe371b3648f25840026374af24a61fcda8c56564401f21f9e8d01fae27caed --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:09:11,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:09:11,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:09:11,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:09:11,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:09:11,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:09:11,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:09:11,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:09:11,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:09:11,825 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:09:11,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:09:11,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:09:11,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:09:11,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:09:11,828 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:09:11,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:09:11,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:09:11,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:09:11,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:09:11,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:09:11,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:09:11,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:09:11,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:09:11,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:09:11,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:09:11,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:09:11,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:09:11,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:09:11,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:09:11,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:09:11,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:09:11,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:09:11,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:09:11,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:09:11,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:09:11,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:09:11,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:09:11,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:09:11,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:09:11,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:09:11,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:09:11,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:09:11,838 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 -> 71fe371b3648f25840026374af24a61fcda8c56564401f21f9e8d01fae27caed [2024-10-14 11:09:12,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:09:12,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:09:12,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:09:12,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:09:12,114 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:09:12,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i [2024-10-14 11:09:13,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:09:13,774 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:09:13,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i [2024-10-14 11:09:13,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9cecd2ff/cac0e7b65f484680a4c263c2fff8130c/FLAG0a99dce52 [2024-10-14 11:09:13,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9cecd2ff/cac0e7b65f484680a4c263c2fff8130c [2024-10-14 11:09:13,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:09:13,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:09:13,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:09:13,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:09:13,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:09:13,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:09:13" (1/1) ... [2024-10-14 11:09:13,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9178b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:13, skipping insertion in model container [2024-10-14 11:09:13,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:09:13" (1/1) ... [2024-10-14 11:09:13,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:09:14,010 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_no-floats_file-95.i[916,929] [2024-10-14 11:09:14,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:09:14,068 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:09:14,084 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_no-floats_file-95.i[916,929] [2024-10-14 11:09:14,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:09:14,185 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:09:14,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:14 WrapperNode [2024-10-14 11:09:14,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:09:14,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:09:14,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:09:14,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:09:14,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:14" (1/1) ... [2024-10-14 11:09:14,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:14" (1/1) ... [2024-10-14 11:09:14,319 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-10-14 11:09:14,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:09:14,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:09:14,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:09:14,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:09:14,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:14" (1/1) ... [2024-10-14 11:09:14,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:14" (1/1) ... [2024-10-14 11:09:14,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:14" (1/1) ... [2024-10-14 11:09:14,356 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 11:09:14,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:14" (1/1) ... [2024-10-14 11:09:14,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:14" (1/1) ... [2024-10-14 11:09:14,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:14" (1/1) ... [2024-10-14 11:09:14,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:14" (1/1) ... [2024-10-14 11:09:14,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:14" (1/1) ... [2024-10-14 11:09:14,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:14" (1/1) ... [2024-10-14 11:09:14,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:09:14,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:09:14,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:09:14,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:09:14,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:14" (1/1) ... [2024-10-14 11:09:14,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:09:14,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:09:14,424 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 11:09:14,428 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 11:09:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:09:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:09:14,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:09:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:09:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:09:14,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:09:14,557 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:09:14,559 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:09:14,884 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-14 11:09:14,884 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:09:14,917 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:09:14,917 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:09:14,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:09:14 BoogieIcfgContainer [2024-10-14 11:09:14,920 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:09:14,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:09:14,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:09:14,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:09:14,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:09:13" (1/3) ... [2024-10-14 11:09:14,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac2e748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:09:14, skipping insertion in model container [2024-10-14 11:09:14,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:14" (2/3) ... [2024-10-14 11:09:14,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac2e748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:09:14, skipping insertion in model container [2024-10-14 11:09:14,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:09:14" (3/3) ... [2024-10-14 11:09:14,929 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-95.i [2024-10-14 11:09:14,943 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:09:14,943 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:09:15,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:09:15,015 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;@7fe23fec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:09:15,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:09:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 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 11:09:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 11:09:15,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:09:15,037 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, 1] [2024-10-14 11:09:15,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:09:15,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:09:15,046 INFO L85 PathProgramCache]: Analyzing trace with hash 240794627, now seen corresponding path program 1 times [2024-10-14 11:09:15,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:09:15,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392090035] [2024-10-14 11:09:15,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:09:15,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:09:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:09:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:09:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:09:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:09:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:09:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:09:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:09:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:09:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:09:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:09:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:09:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:09:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:09:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:09:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:09:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:09:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:09:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:09:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:09:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:15,449 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 11:09:15,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:09:15,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392090035] [2024-10-14 11:09:15,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392090035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:09:15,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:09:15,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:09:15,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280353057] [2024-10-14 11:09:15,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:09:15,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:09:15,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:09:15,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:09:15,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:09:15,482 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 11:09:15,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:09:15,527 INFO L93 Difference]: Finished difference Result 119 states and 203 transitions. [2024-10-14 11:09:15,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:09:15,530 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 118 [2024-10-14 11:09:15,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:09:15,540 INFO L225 Difference]: With dead ends: 119 [2024-10-14 11:09:15,541 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 11:09:15,546 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 11:09:15,551 INFO L432 NwaCegarLoop]: 85 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, 85 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 11:09:15,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:09:15,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 11:09:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-14 11:09:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 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 11:09:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2024-10-14 11:09:15,607 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 118 [2024-10-14 11:09:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:09:15,608 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2024-10-14 11:09:15,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 11:09:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2024-10-14 11:09:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 11:09:15,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:09:15,614 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, 1] [2024-10-14 11:09:15,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:09:15,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:09:15,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:09:15,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1525734331, now seen corresponding path program 1 times [2024-10-14 11:09:15,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:09:15,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788938922] [2024-10-14 11:09:15,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:09:15,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:09:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:09:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:09:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:09:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:09:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:09:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:09:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:09:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:09:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:09:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:09:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:09:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:09:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:09:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:09:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:09:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:09:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:09:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:09:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:09:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:16,171 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 11:09:16,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:09:16,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788938922] [2024-10-14 11:09:16,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788938922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:09:16,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:09:16,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:09:16,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025954177] [2024-10-14 11:09:16,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:09:16,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:09:16,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:09:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:09:16,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:09:16,177 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 11:09:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:09:16,221 INFO L93 Difference]: Finished difference Result 118 states and 177 transitions. [2024-10-14 11:09:16,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:09:16,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 118 [2024-10-14 11:09:16,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:09:16,225 INFO L225 Difference]: With dead ends: 118 [2024-10-14 11:09:16,227 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 11:09:16,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 11:09:16,229 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:09:16,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:09:16,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 11:09:16,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-14 11:09:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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 11:09:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-10-14 11:09:16,247 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 118 [2024-10-14 11:09:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:09:16,251 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-10-14 11:09:16,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 11:09:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-10-14 11:09:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 11:09:16,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:09:16,254 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, 1, 1] [2024-10-14 11:09:16,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:09:16,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:09:16,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:09:16,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1725287539, now seen corresponding path program 1 times [2024-10-14 11:09:16,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:09:16,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334740185] [2024-10-14 11:09:16,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:09:16,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:09:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:09:16,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1219895295] [2024-10-14 11:09:16,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:09:16,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:09:16,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:09:16,339 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 11:09:16,340 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 11:09:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:09:16,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:09:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:09:16,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:09:16,669 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:09:16,671 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:09:16,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 11:09:16,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:09:16,877 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 11:09:16,967 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:09:16,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:09:16 BoogieIcfgContainer [2024-10-14 11:09:16,971 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:09:16,972 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:09:16,972 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:09:16,973 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:09:16,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:09:14" (3/4) ... [2024-10-14 11:09:16,976 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:09:16,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:09:16,979 INFO L158 Benchmark]: Toolchain (without parser) took 3170.61ms. Allocated memory is still 182.5MB. Free memory was 114.1MB in the beginning and 101.1MB in the end (delta: 13.1MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-10-14 11:09:16,980 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 104.9MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:09:16,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.64ms. Allocated memory is still 182.5MB. Free memory was 114.0MB in the beginning and 155.5MB in the end (delta: -41.5MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-10-14 11:09:16,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.32ms. Allocated memory is still 182.5MB. Free memory was 155.5MB in the beginning and 151.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:09:16,981 INFO L158 Benchmark]: Boogie Preprocessor took 63.34ms. Allocated memory is still 182.5MB. Free memory was 151.6MB in the beginning and 147.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:09:16,981 INFO L158 Benchmark]: RCFGBuilder took 535.06ms. Allocated memory is still 182.5MB. Free memory was 147.3MB in the beginning and 124.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 11:09:16,985 INFO L158 Benchmark]: TraceAbstraction took 2049.12ms. Allocated memory is still 182.5MB. Free memory was 124.3MB in the beginning and 101.1MB in the end (delta: 23.2MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2024-10-14 11:09:16,985 INFO L158 Benchmark]: Witness Printer took 4.66ms. Allocated memory is still 182.5MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:09:16,987 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.70ms. Allocated memory is still 104.9MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.64ms. Allocated memory is still 182.5MB. Free memory was 114.0MB in the beginning and 155.5MB in the end (delta: -41.5MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.32ms. Allocated memory is still 182.5MB. Free memory was 155.5MB in the beginning and 151.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.34ms. Allocated memory is still 182.5MB. Free memory was 151.6MB in the beginning and 147.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 535.06ms. Allocated memory is still 182.5MB. Free memory was 147.3MB in the beginning and 124.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2049.12ms. Allocated memory is still 182.5MB. Free memory was 124.3MB in the beginning and 101.1MB in the end (delta: 23.2MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * Witness Printer took 4.66ms. Allocated memory is still 182.5MB. Free memory is still 101.1MB. 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 to_int at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed long int var_1_3 = 1; [L24] signed long int var_1_4 = 8; [L25] signed long int var_1_5 = 255; [L26] signed long int var_1_6 = 50; [L27] unsigned char var_1_7 = 0; [L28] unsigned long int var_1_8 = 8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 5; [L31] unsigned char var_1_12 = 2; [L32] signed short int var_1_13 = 0; [L33] unsigned long int var_1_14 = 16; [L34] signed char var_1_16 = -1; [L35] signed char var_1_17 = -16; [L36] unsigned char last_1_var_1_7 = 0; [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L88] last_1_var_1_7 = var_1_7 [L98] RET updateLastVariables() [L99] CALL updateVariables() [L58] var_1_4 = __VERIFIER_nondet_long() [L59] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L59] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L60] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L60] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=255, var_1_6=50, var_1_7=0, var_1_8=8] [L61] var_1_5 = __VERIFIER_nondet_long() [L62] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L62] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L63] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L63] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=0, var_1_8=8] [L64] var_1_6 = __VERIFIER_nondet_long() [L65] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L65] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L66] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L66] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=8] [L67] var_1_8 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0] [L69] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L69] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L70] var_1_10 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L71] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L72] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L72] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L73] var_1_11 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L74] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L75] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L75] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L78] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L78] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L79] var_1_14 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L80] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L81] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L81] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L82] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L83] var_1_17 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L84] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L85] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=-64, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L99] RET updateVariables() [L100] CALL step() [L40] var_1_1 = ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))) [L41] var_1_3 = ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f))))) [L42] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L43] EXPR var_1_16 & var_1_1 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L43] signed long int stepLocal_0 = var_1_16 & var_1_1; [L44] COND TRUE (- (3351680781u - var_1_8)) > stepLocal_0 [L45] var_1_7 = (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L47] EXPR var_1_7 >> var_1_7 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L47] COND FALSE !((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) [L50] COND FALSE !(var_1_16 >= var_1_1) [L53] var_1_13 = 256 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=256, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR ((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((signed long int) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=256, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_3=23, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L91] EXPR (((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((signed long int) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1)) && (((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) ? (var_1_13 == ((signed short int) ((((4 - var_1_11) < 0 ) ? -(4 - var_1_11) : (4 - var_1_11))))) : ((var_1_16 >= var_1_1) ? (var_1_13 == ((signed short int) (-5 + (var_1_12 - var_1_11)))) : (var_1_13 == ((signed short int) 256)))) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=256, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_3=23, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L91-L92] return ((((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((signed long int) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1)) && (((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) ? (var_1_13 == ((signed short int) ((((4 - var_1_11) < 0 ) ? -(4 - var_1_11) : (4 - var_1_11))))) : ((var_1_16 >= var_1_1) ? (var_1_13 == ((signed short int) (-5 + (var_1_12 - var_1_11)))) : (var_1_13 == ((signed short int) 256))))) && (var_1_16 == ((signed char) var_1_17)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=256, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_3=23, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-255, var_1_11=-256, var_1_12=0, var_1_13=256, var_1_14=1, var_1_16=-1, var_1_17=-1, var_1_1=0, var_1_3=23, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 169 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 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 11:09:17,029 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_no-floats_file-95.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 71fe371b3648f25840026374af24a61fcda8c56564401f21f9e8d01fae27caed --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:09:19,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:09:19,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:09:19,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:09:19,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:09:19,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:09:19,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:09:19,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:09:19,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:09:19,336 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:09:19,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:09:19,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:09:19,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:09:19,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:09:19,338 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:09:19,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:09:19,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:09:19,339 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:09:19,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:09:19,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:09:19,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:09:19,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:09:19,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:09:19,341 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:09:19,342 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:09:19,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:09:19,342 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:09:19,343 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:09:19,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:09:19,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:09:19,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:09:19,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:09:19,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:09:19,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:09:19,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:09:19,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:09:19,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:09:19,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:09:19,346 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:09:19,346 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:09:19,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:09:19,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:09:19,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:09:19,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:09:19,348 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:09:19,348 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 -> 71fe371b3648f25840026374af24a61fcda8c56564401f21f9e8d01fae27caed [2024-10-14 11:09:19,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:09:19,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:09:19,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:09:19,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:09:19,687 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:09:19,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i [2024-10-14 11:09:21,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:09:21,567 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:09:21,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-95.i [2024-10-14 11:09:21,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc7a3de76/5d8ab5d2e5e046c28b958c5318cb823b/FLAGcbae87052 [2024-10-14 11:09:21,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc7a3de76/5d8ab5d2e5e046c28b958c5318cb823b [2024-10-14 11:09:21,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:09:21,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:09:21,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:09:21,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:09:21,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:09:21,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:09:21" (1/1) ... [2024-10-14 11:09:21,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e418f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21, skipping insertion in model container [2024-10-14 11:09:21,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:09:21" (1/1) ... [2024-10-14 11:09:21,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:09:21,816 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_no-floats_file-95.i[916,929] [2024-10-14 11:09:21,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:09:21,898 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:09:21,915 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_no-floats_file-95.i[916,929] [2024-10-14 11:09:21,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:09:21,966 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:09:21,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21 WrapperNode [2024-10-14 11:09:21,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:09:21,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:09:21,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:09:21,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:09:21,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21" (1/1) ... [2024-10-14 11:09:21,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21" (1/1) ... [2024-10-14 11:09:22,007 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-14 11:09:22,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:09:22,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:09:22,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:09:22,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:09:22,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21" (1/1) ... [2024-10-14 11:09:22,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21" (1/1) ... [2024-10-14 11:09:22,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21" (1/1) ... [2024-10-14 11:09:22,034 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 11:09:22,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21" (1/1) ... [2024-10-14 11:09:22,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21" (1/1) ... [2024-10-14 11:09:22,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21" (1/1) ... [2024-10-14 11:09:22,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21" (1/1) ... [2024-10-14 11:09:22,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21" (1/1) ... [2024-10-14 11:09:22,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21" (1/1) ... [2024-10-14 11:09:22,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:09:22,065 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:09:22,065 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:09:22,065 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:09:22,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21" (1/1) ... [2024-10-14 11:09:22,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:09:22,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:09:22,098 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 11:09:22,105 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 11:09:22,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:09:22,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:09:22,143 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:09:22,143 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:09:22,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:09:22,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:09:22,212 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:09:22,214 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:09:28,997 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 11:09:28,997 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:09:29,070 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:09:29,070 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:09:29,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:09:29 BoogieIcfgContainer [2024-10-14 11:09:29,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:09:29,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:09:29,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:09:29,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:09:29,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:09:21" (1/3) ... [2024-10-14 11:09:29,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57baeb0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:09:29, skipping insertion in model container [2024-10-14 11:09:29,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:09:21" (2/3) ... [2024-10-14 11:09:29,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57baeb0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:09:29, skipping insertion in model container [2024-10-14 11:09:29,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:09:29" (3/3) ... [2024-10-14 11:09:29,079 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-95.i [2024-10-14 11:09:29,097 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:09:29,097 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:09:29,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:09:29,187 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;@7fa915d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:09:29,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:09:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 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 11:09:29,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 11:09:29,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:09:29,206 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] [2024-10-14 11:09:29,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:09:29,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:09:29,213 INFO L85 PathProgramCache]: Analyzing trace with hash 111626331, now seen corresponding path program 1 times [2024-10-14 11:09:29,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:09:29,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416097790] [2024-10-14 11:09:29,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:09:29,229 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 11:09:29,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:09:29,234 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 11:09:29,235 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 11:09:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:29,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:09:29,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:09:29,570 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 11:09:29,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:09:29,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:09:29,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416097790] [2024-10-14 11:09:29,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416097790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:09:29,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:09:29,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:09:29,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280531902] [2024-10-14 11:09:29,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:09:29,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:09:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:09:29,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:09:29,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:09:29,605 INFO L87 Difference]: Start difference. First operand has 44 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 11:09:32,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:09:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:09:32,992 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2024-10-14 11:09:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:09:33,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 111 [2024-10-14 11:09:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:09:33,021 INFO L225 Difference]: With dead ends: 85 [2024-10-14 11:09:33,021 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 11:09:33,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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 11:09:33,027 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-14 11:09:33,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-14 11:09:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 11:09:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-14 11:09:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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 11:09:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2024-10-14 11:09:33,063 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 111 [2024-10-14 11:09:33,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:09:33,063 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-10-14 11:09:33,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 11:09:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2024-10-14 11:09:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 11:09:33,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:09:33,066 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] [2024-10-14 11:09:33,078 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 11:09:33,267 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 11:09:33,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:09:33,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:09:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash 667812955, now seen corresponding path program 1 times [2024-10-14 11:09:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:09:33,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596718534] [2024-10-14 11:09:33,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:09:33,270 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 11:09:33,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:09:33,272 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 11:09:33,274 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 11:09:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:33,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 11:09:33,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:09:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 340 proven. 33 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-10-14 11:09:34,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:09:34,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:09:34,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596718534] [2024-10-14 11:09:34,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596718534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:09:34,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [589561045] [2024-10-14 11:09:34,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:09:34,390 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 11:09:34,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 11:09:34,394 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 11:09:34,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-14 11:09:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:09:34,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-14 11:09:34,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:09:47,757 WARN L286 SmtUtils]: Spent 7.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 11:09:58,821 WARN L286 SmtUtils]: Spent 6.80s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 11:10:05,792 WARN L286 SmtUtils]: Spent 6.97s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 11:10:13,785 WARN L286 SmtUtils]: Spent 7.99s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 11:10:25,754 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 11:10:33,615 WARN L286 SmtUtils]: Spent 7.86s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 11:10:40,378 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 11:10:46,228 WARN L286 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)