./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-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.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 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:57:18,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:57:18,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:57:18,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:57:18,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:57:18,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:57:18,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:57:18,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:57:18,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:57:18,737 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:57:18,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:57:18,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:57:18,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:57:18,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:57:18,739 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:57:18,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:57:18,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:57:18,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:57:18,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:57:18,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:57:18,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:57:18,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:57:18,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:57:18,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:57:18,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:57:18,742 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:57:18,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:57:18,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:57:18,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:57:18,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:57:18,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:57:18,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:57:18,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:57:18,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:57:18,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:57:18,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:57:18,745 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:57:18,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:57:18,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:57:18,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:57:18,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:57:18,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:57:18,747 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 -> 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f [2024-10-24 08:57:18,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:57:18,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:57:18,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:57:18,954 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:57:18,954 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:57:18,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-10-24 08:57:20,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:57:20,548 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:57:20,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-10-24 08:57:20,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e24a7e94/7042d1eb45c345148f0c8be2d65ac0a8/FLAG90b64b06f [2024-10-24 08:57:20,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e24a7e94/7042d1eb45c345148f0c8be2d65ac0a8 [2024-10-24 08:57:20,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:57:20,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:57:20,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:57:20,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:57:20,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:57:20,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:57:20" (1/1) ... [2024-10-24 08:57:20,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20, skipping insertion in model container [2024-10-24 08:57:20,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:57:20" (1/1) ... [2024-10-24 08:57:20,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:57:20,770 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-10-24 08:57:20,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:57:20,835 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:57:20,859 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-10-24 08:57:20,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:57:20,897 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:57:20,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20 WrapperNode [2024-10-24 08:57:20,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:57:20,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:57:20,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:57:20,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:57:20,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20" (1/1) ... [2024-10-24 08:57:20,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20" (1/1) ... [2024-10-24 08:57:20,936 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-10-24 08:57:20,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:57:20,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:57:20,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:57:20,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:57:20,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20" (1/1) ... [2024-10-24 08:57:20,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20" (1/1) ... [2024-10-24 08:57:20,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20" (1/1) ... [2024-10-24 08:57:20,962 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:57:20,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20" (1/1) ... [2024-10-24 08:57:20,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20" (1/1) ... [2024-10-24 08:57:20,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20" (1/1) ... [2024-10-24 08:57:20,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20" (1/1) ... [2024-10-24 08:57:20,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20" (1/1) ... [2024-10-24 08:57:20,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20" (1/1) ... [2024-10-24 08:57:20,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:57:20,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:57:20,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:57:20,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:57:20,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20" (1/1) ... [2024-10-24 08:57:20,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:57:20,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:57:21,015 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:57:21,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:57:21,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:57:21,059 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:57:21,059 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:57:21,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:57:21,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:57:21,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:57:21,128 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:57:21,132 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:57:21,282 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 08:57:21,282 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:57:21,317 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:57:21,317 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:57:21,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:57:21 BoogieIcfgContainer [2024-10-24 08:57:21,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:57:21,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:57:21,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:57:21,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:57:21,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:57:20" (1/3) ... [2024-10-24 08:57:21,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a49cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:57:21, skipping insertion in model container [2024-10-24 08:57:21,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:20" (2/3) ... [2024-10-24 08:57:21,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a49cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:57:21, skipping insertion in model container [2024-10-24 08:57:21,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:57:21" (3/3) ... [2024-10-24 08:57:21,327 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-65.i [2024-10-24 08:57:21,340 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:57:21,340 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:57:21,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:57:21,390 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;@2856413f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:57:21,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:57:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 08:57:21,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 08:57:21,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:57:21,402 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:57:21,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:57:21,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:57:21,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1059842933, now seen corresponding path program 1 times [2024-10-24 08:57:21,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:57:21,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337577094] [2024-10-24 08:57:21,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:57:21,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:57:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:57:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:57:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:57:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:57:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:57:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:57:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:57:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:57:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:57:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:57:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:57:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:57:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:57:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:57:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:57:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:57:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:57:21,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:57:21,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337577094] [2024-10-24 08:57:21,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337577094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:57:21,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:57:21,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:57:21,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003872067] [2024-10-24 08:57:21,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:57:21,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:57:21,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:57:21,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:57:21,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:57:21,695 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 08:57:21,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:57:21,736 INFO L93 Difference]: Finished difference Result 85 states and 150 transitions. [2024-10-24 08:57:21,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:57:21,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 98 [2024-10-24 08:57:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:57:21,752 INFO L225 Difference]: With dead ends: 85 [2024-10-24 08:57:21,753 INFO L226 Difference]: Without dead ends: 42 [2024-10-24 08:57:21,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:57:21,759 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:57:21,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:57:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-24 08:57:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-24 08:57:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 08:57:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2024-10-24 08:57:21,859 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 98 [2024-10-24 08:57:21,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:57:21,860 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-10-24 08:57:21,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 08:57:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2024-10-24 08:57:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 08:57:21,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:57:21,868 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:57:21,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:57:21,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:57:21,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:57:21,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1330050187, now seen corresponding path program 1 times [2024-10-24 08:57:21,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:57:21,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872175710] [2024-10-24 08:57:21,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:57:21,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:57:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:57:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:57:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:57:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:57:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:57:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:57:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:57:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:57:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:57:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:57:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:57:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:57:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:57:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:57:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:57:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:57:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:57:23,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:57:23,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872175710] [2024-10-24 08:57:23,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872175710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:57:23,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:57:23,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:57:23,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899380173] [2024-10-24 08:57:23,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:57:23,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:57:23,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:57:23,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:57:23,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:57:23,290 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:57:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:57:23,487 INFO L93 Difference]: Finished difference Result 106 states and 152 transitions. [2024-10-24 08:57:23,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:57:23,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-24 08:57:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:57:23,489 INFO L225 Difference]: With dead ends: 106 [2024-10-24 08:57:23,490 INFO L226 Difference]: Without dead ends: 65 [2024-10-24 08:57:23,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:57:23,491 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 35 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:57:23,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 223 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:57:23,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-24 08:57:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2024-10-24 08:57:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 08:57:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2024-10-24 08:57:23,512 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 98 [2024-10-24 08:57:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:57:23,512 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2024-10-24 08:57:23,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:57:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2024-10-24 08:57:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 08:57:23,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:57:23,517 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:57:23,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:57:23,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:57:23,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:57:23,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1566471563, now seen corresponding path program 1 times [2024-10-24 08:57:23,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:57:23,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36545853] [2024-10-24 08:57:23,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:57:23,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:57:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:57:23,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:57:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:57:23,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:57:23,653 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:57:23,654 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:57:23,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:57:23,661 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 08:57:23,741 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:57:23,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:57:23 BoogieIcfgContainer [2024-10-24 08:57:23,744 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:57:23,745 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:57:23,745 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:57:23,745 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:57:23,745 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:57:21" (3/4) ... [2024-10-24 08:57:23,747 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:57:23,748 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:57:23,752 INFO L158 Benchmark]: Toolchain (without parser) took 3175.20ms. Allocated memory was 142.6MB in the beginning and 289.4MB in the end (delta: 146.8MB). Free memory was 72.8MB in the beginning and 242.5MB in the end (delta: -169.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:57:23,753 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 142.6MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:57:23,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.44ms. Allocated memory was 142.6MB in the beginning and 241.2MB in the end (delta: 98.6MB). Free memory was 72.4MB in the beginning and 211.8MB in the end (delta: -139.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-10-24 08:57:23,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.39ms. Allocated memory is still 241.2MB. Free memory was 211.8MB in the beginning and 209.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:57:23,756 INFO L158 Benchmark]: Boogie Preprocessor took 35.98ms. Allocated memory is still 241.2MB. Free memory was 209.8MB in the beginning and 207.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:57:23,756 INFO L158 Benchmark]: RCFGBuilder took 342.73ms. Allocated memory is still 241.2MB. Free memory was 207.7MB in the beginning and 188.5MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 08:57:23,757 INFO L158 Benchmark]: TraceAbstraction took 2424.35ms. Allocated memory was 241.2MB in the beginning and 289.4MB in the end (delta: 48.2MB). Free memory was 187.8MB in the beginning and 242.5MB in the end (delta: -54.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:57:23,757 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 289.4MB. Free memory is still 242.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:57:23,762 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.10ms. Allocated memory is still 142.6MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.44ms. Allocated memory was 142.6MB in the beginning and 241.2MB in the end (delta: 98.6MB). Free memory was 72.4MB in the beginning and 211.8MB in the end (delta: -139.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.39ms. Allocated memory is still 241.2MB. Free memory was 211.8MB in the beginning and 209.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.98ms. Allocated memory is still 241.2MB. Free memory was 209.8MB in the beginning and 207.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 342.73ms. Allocated memory is still 241.2MB. Free memory was 207.7MB in the beginning and 188.5MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2424.35ms. Allocated memory was 241.2MB in the beginning and 289.4MB in the end (delta: 48.2MB). Free memory was 187.8MB in the beginning and 242.5MB in the end (delta: -54.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 289.4MB. Free memory is still 242.5MB. 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 93, overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1000000000; [L23] unsigned char var_1_3 = 1; [L24] signed long int var_1_4 = 8; [L25] signed long int var_1_5 = -32; [L26] signed long int var_1_9 = 100; [L27] signed long int var_1_12 = 25; [L28] signed long int var_1_13 = 63; [L29] signed long int var_1_14 = 0; [L30] signed long int var_1_15 = 0; [L31] signed char var_1_16 = -8; [L32] signed char var_1_17 = 8; [L33] unsigned short int var_1_18 = 2; [L34] unsigned short int var_1_19 = 50; [L35] unsigned short int var_1_20 = 0; [L36] signed long int last_1_var_1_9 = 100; [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] last_1_var_1_9 = var_1_9 [L100] RET updateLastVariables() [L101] CALL updateVariables() [L64] var_1_3 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L65] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L66] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L66] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L67] var_1_4 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L68] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L69] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L69] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L70] var_1_12 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L71] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L72] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L73] var_1_13 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L74] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L75] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L76] var_1_14 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L77] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L78] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L78] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L79] var_1_15 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L80] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L81] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L81] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L82] var_1_17 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L83] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L84] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L84] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L85] var_1_19 = __VERIFIER_nondet_ushort() [L86] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L86] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L87] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=-65536, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=-65536, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L87] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=-65536, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L101] RET updateVariables() [L102] CALL step() [L40] COND FALSE !(0.625f > last_1_var_1_9) [L45] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=-65536, var_1_1=0, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L47] var_1_16 = var_1_17 [L48] var_1_18 = var_1_19 [L49] var_1_20 = var_1_19 VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L50] COND TRUE \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L51] COND TRUE var_1_20 >= ((var_1_18 - var_1_20) * 64) [L52] var_1_9 = (((((var_1_12) < (50.5)) ? (var_1_12) : (50.5))) - var_1_13) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-32] [L59] COND TRUE var_1_4 > var_1_9 [L60] var_1_5 = (((((var_1_20) > (-64)) ? (var_1_20) : (-64))) + ((var_1_20 + -2) + var_1_18)) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-2, var_1_9=-1] [L102] RET step() [L103] CALL, EXPR property() [L93-L94] return ((((((0.625f > last_1_var_1_9) ? (var_1_3 ? (var_1_1 == ((signed long int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) : (var_1_1 == ((signed long int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) && ((var_1_4 > var_1_9) ? (var_1_5 == ((signed long int) (((((var_1_20) > (-64)) ? (var_1_20) : (-64))) + ((var_1_20 + -2) + var_1_18)))) : 1)) && (var_1_3 ? ((var_1_20 >= ((var_1_18 - var_1_20) * 64)) ? (var_1_9 == ((signed long int) (((((var_1_12) < (50.5)) ? (var_1_12) : (50.5))) - var_1_13))) : 1) : ((var_1_1 <= var_1_1) ? (var_1_9 == ((signed long int) (var_1_13 - (var_1_14 - var_1_15)))) : 1))) && (var_1_16 == ((signed char) var_1_17))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((unsigned short int) var_1_19)) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-2, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-2, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 282 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 122 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 477 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 08:57:23,795 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-65.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 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:57:25,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:57:25,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:57:25,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:57:25,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:57:25,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:57:25,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:57:25,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:57:25,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:57:25,932 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:57:25,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:57:25,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:57:25,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:57:25,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:57:25,934 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:57:25,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:57:25,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:57:25,936 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:57:25,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:57:25,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:57:25,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:57:25,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:57:25,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:57:25,939 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:57:25,939 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:57:25,939 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:57:25,939 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:57:25,939 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:57:25,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:57:25,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:57:25,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:57:25,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:57:25,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:57:25,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:57:25,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:57:25,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:57:25,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:57:25,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:57:25,942 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:57:25,942 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:57:25,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:57:25,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:57:25,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:57:25,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:57:25,946 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:57:25,946 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 -> 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f [2024-10-24 08:57:26,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:57:26,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:57:26,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:57:26,233 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:57:26,233 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:57:26,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-10-24 08:57:27,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:57:27,703 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:57:27,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-10-24 08:57:27,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2909edb1f/393fdb95d31542b3a64cd819bdbea5d0/FLAG9658a3a32 [2024-10-24 08:57:28,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2909edb1f/393fdb95d31542b3a64cd819bdbea5d0 [2024-10-24 08:57:28,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:57:28,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:57:28,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:57:28,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:57:28,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:57:28,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:57:28" (1/1) ... [2024-10-24 08:57:28,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634a179a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28, skipping insertion in model container [2024-10-24 08:57:28,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:57:28" (1/1) ... [2024-10-24 08:57:28,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:57:28,305 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-10-24 08:57:28,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:57:28,371 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:57:28,381 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-10-24 08:57:28,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:57:28,417 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:57:28,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28 WrapperNode [2024-10-24 08:57:28,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:57:28,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:57:28,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:57:28,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:57:28,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28" (1/1) ... [2024-10-24 08:57:28,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28" (1/1) ... [2024-10-24 08:57:28,467 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-10-24 08:57:28,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:57:28,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:57:28,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:57:28,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:57:28,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28" (1/1) ... [2024-10-24 08:57:28,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28" (1/1) ... [2024-10-24 08:57:28,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28" (1/1) ... [2024-10-24 08:57:28,502 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:57:28,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28" (1/1) ... [2024-10-24 08:57:28,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28" (1/1) ... [2024-10-24 08:57:28,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28" (1/1) ... [2024-10-24 08:57:28,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28" (1/1) ... [2024-10-24 08:57:28,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28" (1/1) ... [2024-10-24 08:57:28,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28" (1/1) ... [2024-10-24 08:57:28,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:57:28,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:57:28,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:57:28,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:57:28,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28" (1/1) ... [2024-10-24 08:57:28,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:57:28,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:57:28,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:57:28,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:57:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:57:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:57:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:57:28,621 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:57:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:57:28,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:57:28,696 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:57:28,698 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:57:33,291 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 08:57:33,291 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:57:33,381 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:57:33,381 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:57:33,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:57:33 BoogieIcfgContainer [2024-10-24 08:57:33,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:57:33,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:57:33,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:57:33,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:57:33,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:57:28" (1/3) ... [2024-10-24 08:57:33,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a2978b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:57:33, skipping insertion in model container [2024-10-24 08:57:33,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:57:28" (2/3) ... [2024-10-24 08:57:33,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a2978b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:57:33, skipping insertion in model container [2024-10-24 08:57:33,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:57:33" (3/3) ... [2024-10-24 08:57:33,397 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-65.i [2024-10-24 08:57:33,409 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:57:33,409 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:57:33,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:57:33,500 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;@1830791e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:57:33,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:57:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 08:57:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 08:57:33,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:57:33,525 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:57:33,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:57:33,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:57:33,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1059842933, now seen corresponding path program 1 times [2024-10-24 08:57:33,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:57:33,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992350028] [2024-10-24 08:57:33,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:57:33,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:57:33,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:57:33,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:57:33,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 08:57:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:33,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:57:33,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:57:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-24 08:57:33,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:57:33,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:57:33,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992350028] [2024-10-24 08:57:33,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992350028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:57:33,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:57:33,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:57:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513297686] [2024-10-24 08:57:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:57:33,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:57:33,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:57:33,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:57:33,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:57:33,854 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:57:36,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:57:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:57:36,625 INFO L93 Difference]: Finished difference Result 85 states and 150 transitions. [2024-10-24 08:57:36,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:57:36,655 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-24 08:57:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:57:36,660 INFO L225 Difference]: With dead ends: 85 [2024-10-24 08:57:36,660 INFO L226 Difference]: Without dead ends: 42 [2024-10-24 08:57:36,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:57:36,665 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 08:57:36,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 08:57:36,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-24 08:57:36,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-24 08:57:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 08:57:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2024-10-24 08:57:36,707 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 98 [2024-10-24 08:57:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:57:36,707 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-10-24 08:57:36,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:57:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2024-10-24 08:57:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 08:57:36,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:57:36,711 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:57:36,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 08:57:36,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:57:36,912 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:57:36,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:57:36,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1330050187, now seen corresponding path program 1 times [2024-10-24 08:57:36,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:57:36,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118569281] [2024-10-24 08:57:36,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:57:36,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:57:36,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:57:36,917 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:57:36,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 08:57:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:57:37,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:57:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:57:37,184 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-24 08:57:37,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [862234557] [2024-10-24 08:57:37,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:57:37,185 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 08:57:37,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 08:57:37,188 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 08:57:37,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-24 08:57:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:57:37,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 08:57:37,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:58:07,494 WARN L286 SmtUtils]: Spent 6.87s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 08:58:25,491 WARN L286 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 08:58:33,946 WARN L286 SmtUtils]: Spent 8.10s 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-10-24 08:58:42,024 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 08:58:49,840 WARN L286 SmtUtils]: Spent 7.73s 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-10-24 08:58:57,601 WARN L286 SmtUtils]: Spent 7.76s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)