./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-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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-17.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 45b46b3ee7f86f7814cd473dd2f0c3b871541d9116dfda6389a1ac1f27734388 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:00:05,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:00:05,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:00:05,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:00:05,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:00:05,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:00:05,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:00:05,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:00:05,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:00:05,822 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:00:05,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:00:05,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:00:05,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:00:05,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:00:05,823 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:00:05,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:00:05,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:00:05,824 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:00:05,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:00:05,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:00:05,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:00:05,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:00:05,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:00:05,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:00:05,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:00:05,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:00:05,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:00:05,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:00:05,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:00:05,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:00:05,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:00:05,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:00:05,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:00:05,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:00:05,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:00:05,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:00:05,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:00:05,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:00:05,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:00:05,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:00:05,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:00:05,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:00:05,834 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 -> 45b46b3ee7f86f7814cd473dd2f0c3b871541d9116dfda6389a1ac1f27734388 [2024-11-20 06:00:06,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:00:06,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:00:06,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:00:06,136 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:00:06,136 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:00:06,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.i [2024-11-20 06:00:07,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:00:07,879 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:00:07,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.i [2024-11-20 06:00:07,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea93f6235/d4babf4f424540d5b35eae11425e0686/FLAGe2ada6236 [2024-11-20 06:00:07,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea93f6235/d4babf4f424540d5b35eae11425e0686 [2024-11-20 06:00:07,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:00:07,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:00:07,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:00:07,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:00:07,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:00:07,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:00:07" (1/1) ... [2024-11-20 06:00:07,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f2847b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:07, skipping insertion in model container [2024-11-20 06:00:07,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:00:07" (1/1) ... [2024-11-20 06:00:07,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:00:08,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.i[916,929] [2024-11-20 06:00:08,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:00:08,202 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:00:08,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.i[916,929] [2024-11-20 06:00:08,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:00:08,255 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:00:08,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:08 WrapperNode [2024-11-20 06:00:08,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:00:08,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:00:08,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:00:08,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:00:08,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:08" (1/1) ... [2024-11-20 06:00:08,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:08" (1/1) ... [2024-11-20 06:00:08,305 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-20 06:00:08,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:00:08,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:00:08,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:00:08,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:00:08,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:08" (1/1) ... [2024-11-20 06:00:08,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:08" (1/1) ... [2024-11-20 06:00:08,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:08" (1/1) ... [2024-11-20 06:00:08,336 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-11-20 06:00:08,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:08" (1/1) ... [2024-11-20 06:00:08,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:08" (1/1) ... [2024-11-20 06:00:08,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:08" (1/1) ... [2024-11-20 06:00:08,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:08" (1/1) ... [2024-11-20 06:00:08,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:08" (1/1) ... [2024-11-20 06:00:08,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:08" (1/1) ... [2024-11-20 06:00:08,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:00:08,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:00:08,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:00:08,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:00:08,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:08" (1/1) ... [2024-11-20 06:00:08,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:00:08,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:00:08,405 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-11-20 06:00:08,408 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-11-20 06:00:08,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:00:08,453 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:00:08,453 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:00:08,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:00:08,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:00:08,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:00:08,531 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:00:08,533 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:00:08,842 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 06:00:08,843 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:00:08,864 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:00:08,866 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:00:08,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:00:08 BoogieIcfgContainer [2024-11-20 06:00:08,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:00:08,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:00:08,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:00:08,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:00:08,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:00:07" (1/3) ... [2024-11-20 06:00:08,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fefe33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:00:08, skipping insertion in model container [2024-11-20 06:00:08,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:08" (2/3) ... [2024-11-20 06:00:08,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fefe33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:00:08, skipping insertion in model container [2024-11-20 06:00:08,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:00:08" (3/3) ... [2024-11-20 06:00:08,875 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-17.i [2024-11-20 06:00:08,896 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:00:08,896 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:00:08,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:00:08,990 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;@4a6aa265, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:00:08,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:00:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 06:00:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 06:00:09,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:00:09,013 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 06:00:09,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:00:09,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:00:09,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2015347980, now seen corresponding path program 1 times [2024-11-20 06:00:09,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:00:09,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336095790] [2024-11-20 06:00:09,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:00:09,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:00:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:00:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:00:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:00:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:00:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:00:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:00:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:00:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:00:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:00:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:00:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:00:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:00:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:00:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:00:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:00:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:00:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:00:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:00:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:00:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:00:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:00:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:00:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 06:00:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:00:09,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336095790] [2024-11-20 06:00:09,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336095790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:00:09,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:00:09,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:00:09,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395755902] [2024-11-20 06:00:09,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:00:09,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:00:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:00:09,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:00:09,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:00:09,553 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 06:00:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:00:09,577 INFO L93 Difference]: Finished difference Result 111 states and 196 transitions. [2024-11-20 06:00:09,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:00:09,581 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 134 [2024-11-20 06:00:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:00:09,589 INFO L225 Difference]: With dead ends: 111 [2024-11-20 06:00:09,590 INFO L226 Difference]: Without dead ends: 55 [2024-11-20 06:00:09,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-11-20 06:00:09,601 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:00:09,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:00:09,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-20 06:00:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-20 06:00:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 06:00:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2024-11-20 06:00:09,657 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 134 [2024-11-20 06:00:09,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:00:09,658 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2024-11-20 06:00:09,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 06:00:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2024-11-20 06:00:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 06:00:09,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:00:09,665 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 06:00:09,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:00:09,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:00:09,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:00:09,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1735711156, now seen corresponding path program 1 times [2024-11-20 06:00:09,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:00:09,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773429285] [2024-11-20 06:00:09,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:00:09,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:00:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:00:09,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:00:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:00:10,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:00:10,020 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:00:10,022 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:00:10,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:00:10,030 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-20 06:00:10,142 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:00:10,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:00:10 BoogieIcfgContainer [2024-11-20 06:00:10,147 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:00:10,148 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:00:10,148 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:00:10,148 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:00:10,149 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:00:08" (3/4) ... [2024-11-20 06:00:10,151 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:00:10,153 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:00:10,155 INFO L158 Benchmark]: Toolchain (without parser) took 2239.80ms. Allocated memory is still 142.6MB. Free memory was 67.9MB in the beginning and 84.5MB in the end (delta: -16.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:00:10,158 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 113.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:00:10,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.35ms. Allocated memory is still 142.6MB. Free memory was 67.7MB in the beginning and 105.5MB in the end (delta: -37.8MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-20 06:00:10,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.39ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 102.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:00:10,160 INFO L158 Benchmark]: Boogie Preprocessor took 55.10ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 99.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:00:10,160 INFO L158 Benchmark]: RCFGBuilder took 504.47ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 103.3MB in the end (delta: -4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-20 06:00:10,160 INFO L158 Benchmark]: TraceAbstraction took 1278.66ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 85.1MB in the end (delta: 17.7MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-20 06:00:10,161 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 84.5MB in the end (delta: 635.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:00:10,167 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.17ms. Allocated memory is still 142.6MB. Free memory is still 113.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.35ms. Allocated memory is still 142.6MB. Free memory was 67.7MB in the beginning and 105.5MB in the end (delta: -37.8MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.39ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 102.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.10ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 99.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 504.47ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 103.3MB in the end (delta: -4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1278.66ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 85.1MB in the end (delta: 17.7MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 84.5MB in the end (delta: 635.7kB). 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 109. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 10000000; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 16; [L25] signed long int var_1_4 = 7; [L26] signed long int var_1_5 = 49; [L27] signed short int var_1_6 = -10; [L28] signed long int var_1_7 = 4; [L29] signed long int var_1_8 = 9; [L30] signed short int var_1_9 = 128; [L31] signed short int var_1_10 = 128; [L32] unsigned char var_1_11 = 0; [L33] unsigned long int var_1_12 = 100; [L34] signed long int var_1_13 = 128; [L35] signed long int var_1_14 = 3; [L36] unsigned char var_1_15 = 16; [L37] unsigned char var_1_16 = 2; [L38] unsigned char last_1_var_1_15 = 16; VAL [isInitial=0, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=0, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] CALL updateLastVariables() [L106] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=0, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L116] RET updateLastVariables() [L117] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L74] var_1_3 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L75] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L76] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L76] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L77] var_1_4 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L78] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L79] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L79] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L80] var_1_5 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L81] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L82] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L82] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L83] var_1_7 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=9, var_1_9=128] [L84] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=9, var_1_9=128] [L85] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=9, var_1_9=128] [L85] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=9, var_1_9=128] [L86] var_1_8 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=128] [L87] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=128] [L88] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=128] [L88] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=128] [L89] var_1_9 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L92] var_1_10 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L95] var_1_11 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L96] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L98] var_1_14 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L99] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L100] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L101] var_1_16 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L102] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=254, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=254, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L103] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=254, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L117] RET updateVariables() [L118] CALL step() [L42] var_1_12 = last_1_var_1_15 [L43] unsigned long int stepLocal_1 = var_1_12; [L44] signed short int stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_15=16, stepLocal_0=0, stepLocal_1=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=254, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L45] COND FALSE !(stepLocal_0 >= var_1_10) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=254, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L52] COND TRUE \read(var_1_2) [L53] var_1_1 = (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=254, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=0] [L55] COND TRUE (- (var_1_7 - var_1_8)) <= var_1_3 [L56] var_1_6 = ((8 + var_1_15) - var_1_15) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=254, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=8, var_1_7=0, var_1_8=1, var_1_9=0] [L66] COND TRUE var_1_7 < (var_1_8 - var_1_14) [L67] var_1_13 = ((((var_1_4) > (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3))))) ? (var_1_4) : (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3)))))) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_14=0, var_1_15=16, var_1_16=254, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=8, var_1_7=0, var_1_8=1, var_1_9=0] [L118] RET step() [L119] CALL, EXPR property() [L109-L110] return ((((var_1_2 ? (var_1_1 == ((signed long int) (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))))) : 1) && (((- (var_1_7 - var_1_8)) <= var_1_3) ? (var_1_6 == ((signed short int) ((8 + var_1_15) - var_1_15))) : (var_1_2 ? (var_1_11 ? (var_1_6 == ((signed short int) var_1_15)) : 1) : (var_1_6 == ((signed short int) var_1_15))))) && (var_1_12 == ((unsigned long int) last_1_var_1_15))) && ((var_1_7 < (var_1_8 - var_1_14)) ? (var_1_13 == ((signed long int) ((((var_1_4) > (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3))))) ? (var_1_4) : (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3)))))))) : 1)) && ((var_1_9 >= var_1_10) ? (((var_1_9 + last_1_var_1_15) >= var_1_12) ? (var_1_15 == ((unsigned char) var_1_16)) : (var_1_15 == ((unsigned char) var_1_16))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_13=10000003, var_1_14=0, var_1_15=16, var_1_16=254, var_1_1=10000002, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=8, var_1_7=0, var_1_8=1, var_1_9=0] [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_13=10000003, var_1_14=0, var_1_15=16, var_1_16=254, var_1_1=10000002, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=8, var_1_7=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=16, var_1_10=1, var_1_11=1, var_1_12=16, var_1_13=10000003, var_1_14=0, var_1_15=16, var_1_16=254, var_1_1=10000002, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=8, var_1_7=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 83 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 924/924 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-11-20 06:00:10,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.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 45b46b3ee7f86f7814cd473dd2f0c3b871541d9116dfda6389a1ac1f27734388 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:00:12,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:00:12,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:00:12,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:00:12,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:00:12,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:00:12,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:00:12,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:00:12,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:00:12,510 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:00:12,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:00:12,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:00:12,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:00:12,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:00:12,513 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:00:12,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:00:12,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:00:12,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:00:12,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:00:12,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:00:12,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:00:12,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:00:12,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:00:12,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:00:12,519 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:00:12,519 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:00:12,520 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:00:12,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:00:12,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:00:12,521 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:00:12,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:00:12,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:00:12,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:00:12,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:00:12,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:00:12,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:00:12,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:00:12,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:00:12,523 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:00:12,523 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:00:12,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:00:12,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:00:12,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:00:12,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:00:12,526 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 -> 45b46b3ee7f86f7814cd473dd2f0c3b871541d9116dfda6389a1ac1f27734388 [2024-11-20 06:00:12,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:00:12,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:00:12,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:00:12,930 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:00:12,931 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:00:12,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.i [2024-11-20 06:00:14,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:00:14,914 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:00:14,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.i [2024-11-20 06:00:14,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8376f023/06bf9d0c13d04add928cfdaec660411d/FLAGef48fa6e8 [2024-11-20 06:00:14,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8376f023/06bf9d0c13d04add928cfdaec660411d [2024-11-20 06:00:14,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:00:14,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:00:14,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:00:14,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:00:14,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:00:14,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:00:14" (1/1) ... [2024-11-20 06:00:14,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31acbdb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:14, skipping insertion in model container [2024-11-20 06:00:14,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:00:14" (1/1) ... [2024-11-20 06:00:14,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:00:15,197 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.i[916,929] [2024-11-20 06:00:15,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:00:15,286 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:00:15,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.i[916,929] [2024-11-20 06:00:15,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:00:15,356 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:00:15,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:15 WrapperNode [2024-11-20 06:00:15,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:00:15,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:00:15,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:00:15,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:00:15,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:15" (1/1) ... [2024-11-20 06:00:15,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:15" (1/1) ... [2024-11-20 06:00:15,416 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-11-20 06:00:15,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:00:15,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:00:15,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:00:15,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:00:15,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:15" (1/1) ... [2024-11-20 06:00:15,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:15" (1/1) ... [2024-11-20 06:00:15,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:15" (1/1) ... [2024-11-20 06:00:15,455 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-11-20 06:00:15,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:15" (1/1) ... [2024-11-20 06:00:15,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:15" (1/1) ... [2024-11-20 06:00:15,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:15" (1/1) ... [2024-11-20 06:00:15,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:15" (1/1) ... [2024-11-20 06:00:15,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:15" (1/1) ... [2024-11-20 06:00:15,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:15" (1/1) ... [2024-11-20 06:00:15,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:00:15,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:00:15,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:00:15,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:00:15,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:15" (1/1) ... [2024-11-20 06:00:15,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:00:15,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:00:15,526 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-11-20 06:00:15,530 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-11-20 06:00:15,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:00:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:00:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:00:15,574 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:00:15,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:00:15,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:00:15,664 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:00:15,667 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:00:25,373 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 06:00:25,373 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:00:25,389 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:00:25,390 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:00:25,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:00:25 BoogieIcfgContainer [2024-11-20 06:00:25,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:00:25,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:00:25,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:00:25,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:00:25,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:00:14" (1/3) ... [2024-11-20 06:00:25,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d5c330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:00:25, skipping insertion in model container [2024-11-20 06:00:25,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:15" (2/3) ... [2024-11-20 06:00:25,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d5c330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:00:25, skipping insertion in model container [2024-11-20 06:00:25,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:00:25" (3/3) ... [2024-11-20 06:00:25,402 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-17.i [2024-11-20 06:00:25,419 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:00:25,420 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:00:25,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:00:25,507 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;@554316cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:00:25,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:00:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 06:00:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 06:00:25,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:00:25,546 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 06:00:25,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:00:25,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:00:25,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2015347980, now seen corresponding path program 1 times [2024-11-20 06:00:25,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:00:25,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783111086] [2024-11-20 06:00:25,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:00:25,569 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-11-20 06:00:25,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:00:25,574 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-11-20 06:00:25,575 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-11-20 06:00:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:25,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:00:25,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:00:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-20 06:00:26,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:00:26,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:00:26,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783111086] [2024-11-20 06:00:26,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783111086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:00:26,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:00:26,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:00:26,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082533836] [2024-11-20 06:00:26,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:00:26,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:00:26,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:00:26,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:00:26,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:00:26,044 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 06:00:26,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:00:26,068 INFO L93 Difference]: Finished difference Result 111 states and 196 transitions. [2024-11-20 06:00:26,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:00:26,071 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 134 [2024-11-20 06:00:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:00:26,078 INFO L225 Difference]: With dead ends: 111 [2024-11-20 06:00:26,078 INFO L226 Difference]: Without dead ends: 55 [2024-11-20 06:00:26,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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-11-20 06:00:26,085 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:00:26,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:00:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-20 06:00:26,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-20 06:00:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 06:00:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2024-11-20 06:00:26,126 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 134 [2024-11-20 06:00:26,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:00:26,127 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2024-11-20 06:00:26,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 06:00:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2024-11-20 06:00:26,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 06:00:26,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:00:26,131 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 06:00:26,147 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-11-20 06:00:26,331 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-11-20 06:00:26,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:00:26,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:00:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1735711156, now seen corresponding path program 1 times [2024-11-20 06:00:26,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:00:26,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786352416] [2024-11-20 06:00:26,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:00:26,334 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-11-20 06:00:26,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:00:26,338 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-11-20 06:00:26,339 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-11-20 06:00:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:00:26,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:00:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:00:26,902 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-20 06:00:26,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [219642476] [2024-11-20 06:00:26,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:00:26,903 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 06:00:26,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 06:00:26,906 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-11-20 06:00:26,909 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-11-20 06:00:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:27,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-20 06:00:27,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:00:41,006 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:00:49,168 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:00:57,358 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:01:05,467 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:01:13,635 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:01:21,806 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:01:29,904 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:01:38,065 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:01:46,238 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)