./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-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-40.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 0300ce453fbcc7b624e880ece9c63a87dd96de28f551375d60d4427eef99d3e8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:54:47,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:54:47,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:54:47,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:54:47,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:54:47,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:54:47,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:54:47,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:54:47,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:54:47,708 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:54:47,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:54:47,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:54:47,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:54:47,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:54:47,710 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:54:47,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:54:47,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:54:47,711 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:54:47,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:54:47,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:54:47,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:54:47,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:54:47,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:54:47,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:54:47,714 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:54:47,714 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:54:47,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:54:47,715 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:54:47,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:54:47,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:54:47,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:54:47,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:54:47,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:54:47,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:54:47,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:54:47,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:54:47,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:54:47,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:54:47,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:54:47,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:54:47,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:54:47,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:54:47,721 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 -> 0300ce453fbcc7b624e880ece9c63a87dd96de28f551375d60d4427eef99d3e8 [2024-10-24 08:54:47,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:54:47,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:54:47,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:54:47,980 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:54:47,981 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:54:47,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.i [2024-10-24 08:54:49,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:54:49,561 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:54:49,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.i [2024-10-24 08:54:49,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf67236a/9c8616f74bef478c8246fb17af2e4895/FLAG46487112f [2024-10-24 08:54:49,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf67236a/9c8616f74bef478c8246fb17af2e4895 [2024-10-24 08:54:49,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:54:49,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:54:49,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:54:49,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:54:49,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:54:49,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:54:49" (1/1) ... [2024-10-24 08:54:49,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7c557d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49, skipping insertion in model container [2024-10-24 08:54:49,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:54:49" (1/1) ... [2024-10-24 08:54:49,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:54:49,777 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-40.i[916,929] [2024-10-24 08:54:49,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:54:49,832 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:54:49,841 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-40.i[916,929] [2024-10-24 08:54:49,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:54:49,880 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:54:49,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49 WrapperNode [2024-10-24 08:54:49,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:54:49,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:54:49,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:54:49,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:54:49,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49" (1/1) ... [2024-10-24 08:54:49,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49" (1/1) ... [2024-10-24 08:54:49,922 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-10-24 08:54:49,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:54:49,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:54:49,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:54:49,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:54:49,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49" (1/1) ... [2024-10-24 08:54:49,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49" (1/1) ... [2024-10-24 08:54:49,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49" (1/1) ... [2024-10-24 08:54:49,953 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-24 08:54:49,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49" (1/1) ... [2024-10-24 08:54:49,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49" (1/1) ... [2024-10-24 08:54:49,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49" (1/1) ... [2024-10-24 08:54:49,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49" (1/1) ... [2024-10-24 08:54:49,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49" (1/1) ... [2024-10-24 08:54:49,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49" (1/1) ... [2024-10-24 08:54:49,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:54:49,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:54:49,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:54:49,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:54:49,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49" (1/1) ... [2024-10-24 08:54:49,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:54:49,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:54:50,012 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-24 08:54:50,018 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-24 08:54:50,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:54:50,062 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:54:50,063 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:54:50,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:54:50,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:54:50,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:54:50,147 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:54:50,149 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:54:50,416 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 08:54:50,416 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:54:50,456 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:54:50,457 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:54:50,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:54:50 BoogieIcfgContainer [2024-10-24 08:54:50,457 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:54:50,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:54:50,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:54:50,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:54:50,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:54:49" (1/3) ... [2024-10-24 08:54:50,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468d08de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:54:50, skipping insertion in model container [2024-10-24 08:54:50,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:49" (2/3) ... [2024-10-24 08:54:50,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468d08de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:54:50, skipping insertion in model container [2024-10-24 08:54:50,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:54:50" (3/3) ... [2024-10-24 08:54:50,466 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-40.i [2024-10-24 08:54:50,478 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:54:50,478 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:54:50,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:54:50,539 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;@e623aad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:54:50,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:54:50,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:54:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 08:54:50,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:50,558 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:54:50,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:50,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:50,563 INFO L85 PathProgramCache]: Analyzing trace with hash 615425137, now seen corresponding path program 1 times [2024-10-24 08:54:50,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:50,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601981069] [2024-10-24 08:54:50,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:50,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:54:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:54:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 08:54:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:54:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 08:54:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:54:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 08:54:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:54:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 08:54:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 08:54:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 08:54:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 08:54:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 08:54:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:54:50,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:50,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601981069] [2024-10-24 08:54:50,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601981069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:50,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:50,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:54:51,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514232763] [2024-10-24 08:54:51,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:51,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:54:51,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:51,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:54:51,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:54:51,067 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 08:54:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:51,125 INFO L93 Difference]: Finished difference Result 115 states and 204 transitions. [2024-10-24 08:54:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:54:51,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 122 [2024-10-24 08:54:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:51,138 INFO L225 Difference]: With dead ends: 115 [2024-10-24 08:54:51,138 INFO L226 Difference]: Without dead ends: 57 [2024-10-24 08:54:51,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-24 08:54:51,146 INFO L432 NwaCegarLoop]: 84 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, 84 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-24 08:54:51,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:54:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-24 08:54:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-24 08:54:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:54:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 87 transitions. [2024-10-24 08:54:51,206 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 87 transitions. Word has length 122 [2024-10-24 08:54:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:51,206 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 87 transitions. [2024-10-24 08:54:51,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 08:54:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2024-10-24 08:54:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 08:54:51,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:51,212 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:54:51,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:54:51,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:51,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash 793839277, now seen corresponding path program 1 times [2024-10-24 08:54:51,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:51,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922875708] [2024-10-24 08:54:51,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:51,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:54:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:54:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 08:54:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:54:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 08:54:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:54:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 08:54:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 08:54:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 08:54:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 08:54:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 08:54:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 08:54:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 08:54:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:54:51,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:51,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922875708] [2024-10-24 08:54:51,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922875708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:51,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:51,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:54:51,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861908309] [2024-10-24 08:54:51,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:51,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:54:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:51,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:54:51,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:54:51,659 INFO L87 Difference]: Start difference. First operand 57 states and 87 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:54:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:51,730 INFO L93 Difference]: Finished difference Result 130 states and 197 transitions. [2024-10-24 08:54:51,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:54:51,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 122 [2024-10-24 08:54:51,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:51,734 INFO L225 Difference]: With dead ends: 130 [2024-10-24 08:54:51,734 INFO L226 Difference]: Without dead ends: 74 [2024-10-24 08:54:51,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:54:51,738 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 19 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:51,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 250 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:54:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-24 08:54:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2024-10-24 08:54:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:54:51,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 98 transitions. [2024-10-24 08:54:51,756 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 98 transitions. Word has length 122 [2024-10-24 08:54:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:51,757 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 98 transitions. [2024-10-24 08:54:51,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:54:51,757 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 98 transitions. [2024-10-24 08:54:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 08:54:51,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:51,763 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:54:51,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:54:51,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:51,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1934483211, now seen corresponding path program 1 times [2024-10-24 08:54:51,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:51,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872445715] [2024-10-24 08:54:51,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:51,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 08:54:51,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1813698295] [2024-10-24 08:54:51,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:51,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:54:51,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:54:51,866 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-24 08:54:51,867 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-24 08:54:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:54:52,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:54:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:54:52,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:54:52,201 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:54:52,203 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:54:52,220 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-24 08:54:52,405 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-24 08:54:52,409 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 08:54:52,499 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:54:52,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:54:52 BoogieIcfgContainer [2024-10-24 08:54:52,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:54:52,503 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:54:52,503 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:54:52,504 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:54:52,504 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:54:50" (3/4) ... [2024-10-24 08:54:52,506 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:54:52,507 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:54:52,508 INFO L158 Benchmark]: Toolchain (without parser) took 2914.89ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 142.9MB in the beginning and 101.4MB in the end (delta: 41.5MB). Peak memory consumption was 100.8MB. Max. memory is 16.1GB. [2024-10-24 08:54:52,508 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:54:52,508 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.19ms. Allocated memory is still 176.2MB. Free memory was 142.9MB in the beginning and 128.1MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 08:54:52,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.02ms. Allocated memory is still 176.2MB. Free memory was 128.1MB in the beginning and 125.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:54:52,509 INFO L158 Benchmark]: Boogie Preprocessor took 49.30ms. Allocated memory is still 176.2MB. Free memory was 125.5MB in the beginning and 122.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:54:52,510 INFO L158 Benchmark]: RCFGBuilder took 484.16ms. Allocated memory is still 176.2MB. Free memory was 122.5MB in the beginning and 101.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 08:54:52,510 INFO L158 Benchmark]: TraceAbstraction took 2043.28ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 100.4MB in the beginning and 101.4MB in the end (delta: -974.4kB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2024-10-24 08:54:52,510 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 234.9MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:54:52,512 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.18ms. Allocated memory is still 176.2MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.19ms. Allocated memory is still 176.2MB. Free memory was 142.9MB in the beginning and 128.1MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.02ms. Allocated memory is still 176.2MB. Free memory was 128.1MB in the beginning and 125.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.30ms. Allocated memory is still 176.2MB. Free memory was 125.5MB in the beginning and 122.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 484.16ms. Allocated memory is still 176.2MB. Free memory was 122.5MB in the beginning and 101.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2043.28ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 100.4MB in the beginning and 101.4MB in the end (delta: -974.4kB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 234.9MB. Free memory is still 101.4MB. 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 101, overapproximation of someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 64; [L26] signed long int var_1_8 = -2; [L27] signed long int var_1_9 = -10; [L28] unsigned char var_1_11 = 128; [L29] unsigned char var_1_12 = 1; [L30] signed long int var_1_13 = 8; [L31] signed long int var_1_15 = 49; [L32] signed char var_1_16 = -2; [L33] signed char var_1_17 = 25; [L34] signed char var_1_18 = -5; [L35] signed long int var_1_19 = 7; [L36] signed short int var_1_20 = 1; [L37] signed short int var_1_21 = -256; [L38] signed long int last_1_var_1_13 = 8; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] last_1_var_1_13 = var_1_13 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L72] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L72] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L73] var_1_8 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L74] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L75] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L75] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L76] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L76] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L77] var_1_9 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L78] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L79] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L79] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L80] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L80] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=128, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L81] var_1_11 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_11 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L82] RET assume_abort_if_not(var_1_11 >= 127) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L83] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L83] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=1, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L84] var_1_12 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L85] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L86] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L86] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=49, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L87] var_1_15 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L88] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L89] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L89] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L90] var_1_17 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L91] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L92] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L92] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L93] var_1_18 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L94] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L95] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L95] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L109] RET updateVariables() [L110] CALL step() [L42] COND TRUE \read(var_1_3) [L43] var_1_16 = ((((var_1_17) > ((-2 + var_1_18))) ? (var_1_17) : ((-2 + var_1_18)))) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=7, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L45] var_1_19 = var_1_15 [L46] var_1_20 = var_1_16 [L47] var_1_21 = var_1_18 VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=9, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L48] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=9, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L49] COND FALSE !(var_1_3 && (var_1_19 <= (- 63.9f))) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=9, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L57] EXPR var_1_21 | var_1_16 VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=9, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=2] [L57] COND TRUE ((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16) [L58] var_1_7 = (var_1_11 - var_1_12) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=8, var_1_15=9, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=9, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] [L62] COND TRUE var_1_19 != ((((last_1_var_1_13) < (var_1_19)) ? (last_1_var_1_13) : (var_1_19))) [L63] var_1_13 = (var_1_15 + (127.4 - 8.25)) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_15=9, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=9, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR (var_1_2 ? ((var_1_3 && (var_1_19 <= (- 63.9f))) ? ((var_1_19 >= var_1_19) ? (var_1_3 ? (var_1_1 == ((signed long int) var_1_21)) : 1) : 1) : 1) : 1) && ((((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16)) ? (var_1_7 == ((unsigned char) (var_1_11 - var_1_12))) : (var_1_7 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_15=9, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=9, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] [L101-L102] return ((((((var_1_2 ? ((var_1_3 && (var_1_19 <= (- 63.9f))) ? ((var_1_19 >= var_1_19) ? (var_1_3 ? (var_1_1 == ((signed long int) var_1_21)) : 1) : 1) : 1) : 1) && ((((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16)) ? (var_1_7 == ((unsigned char) (var_1_11 - var_1_12))) : (var_1_7 == ((unsigned char) var_1_12)))) && ((var_1_19 != ((((last_1_var_1_13) < (var_1_19)) ? (last_1_var_1_13) : (var_1_19)))) ? (var_1_13 == ((signed long int) (var_1_15 + (127.4 - 8.25)))) : 1)) && (var_1_3 ? (var_1_16 == ((signed char) ((((var_1_17) > ((-2 + var_1_18))) ? (var_1_17) : ((-2 + var_1_18)))))) : 1)) && (var_1_19 == ((signed long int) var_1_15))) && (var_1_20 == ((signed short int) var_1_16))) && (var_1_21 == ((signed short int) var_1_18)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=0, var_1_15=9, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=9, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=8, var_1_11=127, var_1_12=0, var_1_13=0, var_1_15=9, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=9, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 334 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 170 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 258 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1520/1520 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-24 08:54:52,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.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 0300ce453fbcc7b624e880ece9c63a87dd96de28f551375d60d4427eef99d3e8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:54:54,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:54:54,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:54:54,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:54:54,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:54:54,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:54:54,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:54:54,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:54:54,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:54:54,809 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:54:54,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:54:54,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:54:54,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:54:54,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:54:54,812 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:54:54,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:54:54,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:54:54,813 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:54:54,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:54:54,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:54:54,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:54:54,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:54:54,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:54:54,815 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:54:54,815 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:54:54,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:54:54,816 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:54:54,816 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:54:54,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:54:54,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:54:54,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:54:54,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:54:54,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:54:54,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:54:54,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:54:54,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:54:54,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:54:54,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:54:54,819 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:54:54,819 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:54:54,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:54:54,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:54:54,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:54:54,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:54:54,821 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:54:54,822 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 -> 0300ce453fbcc7b624e880ece9c63a87dd96de28f551375d60d4427eef99d3e8 [2024-10-24 08:54:55,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:54:55,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:54:55,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:54:55,170 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:54:55,170 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:54:55,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.i [2024-10-24 08:54:56,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:54:56,994 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:54:56,995 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-40.i [2024-10-24 08:54:57,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/139f774c7/e9b8f2d1b0aa4a428642e48ce2c4f9e9/FLAGe2f9f3280 [2024-10-24 08:54:57,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/139f774c7/e9b8f2d1b0aa4a428642e48ce2c4f9e9 [2024-10-24 08:54:57,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:54:57,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:54:57,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:54:57,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:54:57,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:54:57,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:54:57" (1/1) ... [2024-10-24 08:54:57,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94615f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57, skipping insertion in model container [2024-10-24 08:54:57,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:54:57" (1/1) ... [2024-10-24 08:54:57,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:54:57,236 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-40.i[916,929] [2024-10-24 08:54:57,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:54:57,303 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:54:57,315 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-40.i[916,929] [2024-10-24 08:54:57,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:54:57,366 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:54:57,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57 WrapperNode [2024-10-24 08:54:57,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:54:57,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:54:57,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:54:57,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:54:57,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57" (1/1) ... [2024-10-24 08:54:57,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57" (1/1) ... [2024-10-24 08:54:57,420 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-10-24 08:54:57,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:54:57,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:54:57,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:54:57,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:54:57,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57" (1/1) ... [2024-10-24 08:54:57,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57" (1/1) ... [2024-10-24 08:54:57,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57" (1/1) ... [2024-10-24 08:54:57,467 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-24 08:54:57,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57" (1/1) ... [2024-10-24 08:54:57,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57" (1/1) ... [2024-10-24 08:54:57,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57" (1/1) ... [2024-10-24 08:54:57,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57" (1/1) ... [2024-10-24 08:54:57,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57" (1/1) ... [2024-10-24 08:54:57,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57" (1/1) ... [2024-10-24 08:54:57,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:54:57,495 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:54:57,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:54:57,495 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:54:57,496 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57" (1/1) ... [2024-10-24 08:54:57,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:54:57,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:54:57,525 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-24 08:54:57,531 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-24 08:54:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:54:57,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:54:57,573 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:54:57,573 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:54:57,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:54:57,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:54:57,675 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:54:57,677 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:55:01,803 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 08:55:01,804 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:55:01,865 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:55:01,866 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:55:01,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:55:01 BoogieIcfgContainer [2024-10-24 08:55:01,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:55:01,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:55:01,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:55:01,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:55:01,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:54:57" (1/3) ... [2024-10-24 08:55:01,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562ef6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:55:01, skipping insertion in model container [2024-10-24 08:55:01,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:57" (2/3) ... [2024-10-24 08:55:01,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562ef6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:55:01, skipping insertion in model container [2024-10-24 08:55:01,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:55:01" (3/3) ... [2024-10-24 08:55:01,877 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-40.i [2024-10-24 08:55:01,894 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:55:01,895 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:55:01,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:55:01,968 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;@544558b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:55:01,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:55:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:55:01,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 08:55:01,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:55:01,990 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:55:01,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:55:01,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:55:01,997 INFO L85 PathProgramCache]: Analyzing trace with hash -675454418, now seen corresponding path program 1 times [2024-10-24 08:55:02,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:55:02,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095055510] [2024-10-24 08:55:02,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:02,012 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-24 08:55:02,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:55:02,016 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-24 08:55:02,017 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-24 08:55:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:02,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:55:02,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:55:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-10-24 08:55:02,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:55:02,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:55:02,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095055510] [2024-10-24 08:55:02,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095055510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:55:02,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:55:02,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:55:02,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788284557] [2024-10-24 08:55:02,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:55:02,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:55:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:55:02,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:55:02,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:55:02,445 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:55:04,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:55:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:55:04,040 INFO L93 Difference]: Finished difference Result 97 states and 176 transitions. [2024-10-24 08:55:04,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:55:04,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 119 [2024-10-24 08:55:04,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:55:04,078 INFO L225 Difference]: With dead ends: 97 [2024-10-24 08:55:04,078 INFO L226 Difference]: Without dead ends: 48 [2024-10-24 08:55:04,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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-24 08:55:04,082 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 08:55:04,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 08:55:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-24 08:55:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-24 08:55:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:55:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2024-10-24 08:55:04,122 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 119 [2024-10-24 08:55:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:55:04,123 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2024-10-24 08:55:04,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:55:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2024-10-24 08:55:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 08:55:04,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:55:04,126 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:55:04,139 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-24 08:55:04,327 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-24 08:55:04,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:55:04,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:55:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1147893390, now seen corresponding path program 1 times [2024-10-24 08:55:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:55:04,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127328175] [2024-10-24 08:55:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:04,329 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-24 08:55:04,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:55:04,331 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-24 08:55:04,332 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-24 08:55:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:55:04,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:55:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:55:04,915 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-24 08:55:04,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1695376947] [2024-10-24 08:55:04,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:04,916 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 08:55:04,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 08:55:04,920 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 08:55:04,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-24 08:55:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:05,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 08:55:05,999 INFO L278 TraceCheckSpWp]: Computing forward predicates...