./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 55e583a0a9f7f2653eed51c0b81d821a7cc045000a63c3ac74a8989888b39b3b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:47:50,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:47:50,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:47:50,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:47:50,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:47:50,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:47:50,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:47:50,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:47:50,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:47:50,211 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:47:50,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:47:50,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:47:50,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:47:50,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:47:50,214 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:47:50,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:47:50,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:47:50,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:47:50,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:47:50,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:47:50,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:47:50,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:47:50,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:47:50,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:47:50,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:47:50,219 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:47:50,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:47:50,220 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:47:50,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:47:50,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:47:50,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:47:50,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:47:50,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:47:50,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:47:50,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:47:50,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:47:50,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:47:50,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:47:50,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:47:50,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:47:50,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:47:50,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:47:50,224 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-clean/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-clean/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 -> 55e583a0a9f7f2653eed51c0b81d821a7cc045000a63c3ac74a8989888b39b3b [2024-10-11 10:47:50,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:47:50,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:47:50,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:47:50,531 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:47:50,531 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:47:50,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i [2024-10-11 10:47:51,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:47:52,183 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:47:52,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i [2024-10-11 10:47:52,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4f7aaefac/cddfa16a3e6745c689718739cdf6c0e3/FLAG930ce3086 [2024-10-11 10:47:52,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4f7aaefac/cddfa16a3e6745c689718739cdf6c0e3 [2024-10-11 10:47:52,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:47:52,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:47:52,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:47:52,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:47:52,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:47:52,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:47:52" (1/1) ... [2024-10-11 10:47:52,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e7db46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52, skipping insertion in model container [2024-10-11 10:47:52,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:47:52" (1/1) ... [2024-10-11 10:47:52,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:47:52,768 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i[917,930] [2024-10-11 10:47:52,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:47:52,833 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:47:52,846 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i[917,930] [2024-10-11 10:47:52,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:47:52,891 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:47:52,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52 WrapperNode [2024-10-11 10:47:52,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:47:52,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:47:52,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:47:52,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:47:52,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52" (1/1) ... [2024-10-11 10:47:52,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52" (1/1) ... [2024-10-11 10:47:52,958 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-10-11 10:47:52,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:47:52,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:47:52,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:47:52,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:47:52,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52" (1/1) ... [2024-10-11 10:47:52,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52" (1/1) ... [2024-10-11 10:47:52,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52" (1/1) ... [2024-10-11 10:47:53,003 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-11 10:47:53,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52" (1/1) ... [2024-10-11 10:47:53,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52" (1/1) ... [2024-10-11 10:47:53,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52" (1/1) ... [2024-10-11 10:47:53,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52" (1/1) ... [2024-10-11 10:47:53,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52" (1/1) ... [2024-10-11 10:47:53,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52" (1/1) ... [2024-10-11 10:47:53,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:47:53,031 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:47:53,031 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:47:53,031 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:47:53,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52" (1/1) ... [2024-10-11 10:47:53,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:47:53,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:47:53,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:47:53,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:47:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:47:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:47:53,131 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:47:53,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:47:53,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:47:53,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:47:53,221 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:47:53,223 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:47:53,615 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 10:47:53,616 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:47:53,649 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:47:53,652 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:47:53,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:47:53 BoogieIcfgContainer [2024-10-11 10:47:53,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:47:53,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:47:53,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:47:53,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:47:53,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:47:52" (1/3) ... [2024-10-11 10:47:53,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45170037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:47:53, skipping insertion in model container [2024-10-11 10:47:53,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:47:52" (2/3) ... [2024-10-11 10:47:53,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45170037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:47:53, skipping insertion in model container [2024-10-11 10:47:53,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:47:53" (3/3) ... [2024-10-11 10:47:53,667 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-64.i [2024-10-11 10:47:53,685 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:47:53,685 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:47:53,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:47:53,752 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;@6b99980, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:47:53,752 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:47:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:47:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 10:47:53,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:47:53,774 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:47:53,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:47:53,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:47:53,781 INFO L85 PathProgramCache]: Analyzing trace with hash -447702071, now seen corresponding path program 1 times [2024-10-11 10:47:53,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:47:53,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501315059] [2024-10-11 10:47:53,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:47:53,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:47:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:47:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:47:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:47:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:47:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:47:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:47:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:47:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:47:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:47:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:47:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:47:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:47:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:47:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:47:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:47:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:47:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:47:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:47:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:47:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:47:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:47:54,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:47:54,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501315059] [2024-10-11 10:47:54,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501315059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:47:54,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:47:54,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:47:54,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736963371] [2024-10-11 10:47:54,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:47:54,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:47:54,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:47:54,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:47:54,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:47:54,293 INFO L87 Difference]: Start difference. First operand has 62 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:47:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:47:54,340 INFO L93 Difference]: Finished difference Result 121 states and 212 transitions. [2024-10-11 10:47:54,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:47:54,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2024-10-11 10:47:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:47:54,355 INFO L225 Difference]: With dead ends: 121 [2024-10-11 10:47:54,355 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 10:47:54,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:47:54,364 INFO L432 NwaCegarLoop]: 89 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, 89 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-11 10:47:54,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:47:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 10:47:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-11 10:47:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:47:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2024-10-11 10:47:54,418 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 124 [2024-10-11 10:47:54,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:47:54,419 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. [2024-10-11 10:47:54,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:47:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. [2024-10-11 10:47:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 10:47:54,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:47:54,423 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:47:54,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:47:54,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:47:54,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:47:54,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1637600125, now seen corresponding path program 1 times [2024-10-11 10:47:54,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:47:54,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036382353] [2024-10-11 10:47:54,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:47:54,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:47:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:47:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:47:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:47:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:47:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:47:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:47:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:47:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:47:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:47:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:47:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:47:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:47:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:47:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:47:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:55,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:47:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:56,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:47:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:56,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:47:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:56,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:47:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:56,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:47:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:56,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:47:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:47:56,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:47:56,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036382353] [2024-10-11 10:47:56,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036382353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:47:56,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:47:56,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:47:56,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056979693] [2024-10-11 10:47:56,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:47:56,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:47:56,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:47:56,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:47:56,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:47:56,057 INFO L87 Difference]: Start difference. First operand 60 states and 92 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:47:56,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:47:56,925 INFO L93 Difference]: Finished difference Result 287 states and 429 transitions. [2024-10-11 10:47:56,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 10:47:56,925 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2024-10-11 10:47:56,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:47:56,930 INFO L225 Difference]: With dead ends: 287 [2024-10-11 10:47:56,930 INFO L226 Difference]: Without dead ends: 228 [2024-10-11 10:47:56,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-11 10:47:56,932 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 268 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:47:56,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 488 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:47:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-11 10:47:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 71. [2024-10-11 10:47:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:47:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2024-10-11 10:47:56,953 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 124 [2024-10-11 10:47:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:47:56,954 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2024-10-11 10:47:56,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:47:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2024-10-11 10:47:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 10:47:56,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:47:56,957 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:47:56,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:47:56,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:47:56,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:47:56,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1244573115, now seen corresponding path program 1 times [2024-10-11 10:47:56,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:47:56,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894098510] [2024-10-11 10:47:56,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:47:56,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:47:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:47:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:47:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:47:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:47:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:47:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:47:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:47:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:47:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:47:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:47:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:47:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:47:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:47:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:47:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:47:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:47:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:47:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:47:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:47:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:47:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 10:47:57,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:47:57,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894098510] [2024-10-11 10:47:57,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894098510] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:47:57,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808313170] [2024-10-11 10:47:57,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:47:57,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:47:57,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:47:57,746 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:47:57,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:47:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:47:57,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 10:47:57,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:48:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 429 proven. 39 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-11 10:48:00,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:48:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 69 proven. 42 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-10-11 10:48:01,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808313170] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:48:01,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:48:01,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 28 [2024-10-11 10:48:01,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609507873] [2024-10-11 10:48:01,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:48:01,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 10:48:01,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:48:01,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 10:48:01,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2024-10-11 10:48:01,852 INFO L87 Difference]: Start difference. First operand 71 states and 109 transitions. Second operand has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-10-11 10:48:03,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:48:03,914 INFO L93 Difference]: Finished difference Result 290 states and 419 transitions. [2024-10-11 10:48:03,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-11 10:48:03,915 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) Word has length 124 [2024-10-11 10:48:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:48:03,922 INFO L225 Difference]: With dead ends: 290 [2024-10-11 10:48:03,925 INFO L226 Difference]: Without dead ends: 220 [2024-10-11 10:48:03,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=656, Invalid=2766, Unknown=0, NotChecked=0, Total=3422 [2024-10-11 10:48:03,929 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 519 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:48:03,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 823 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 10:48:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-11 10:48:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 175. [2024-10-11 10:48:03,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 116 states have (on average 1.3017241379310345) internal successors, (151), 117 states have internal predecessors, (151), 51 states have call successors, (51), 7 states have call predecessors, (51), 7 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 10:48:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2024-10-11 10:48:03,979 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 124 [2024-10-11 10:48:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:48:03,980 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2024-10-11 10:48:03,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-10-11 10:48:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2024-10-11 10:48:03,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 10:48:03,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:48:03,986 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:48:04,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 10:48:04,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:48:04,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:48:04,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:48:04,187 INFO L85 PathProgramCache]: Analyzing trace with hash -645913840, now seen corresponding path program 1 times [2024-10-11 10:48:04,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:48:04,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874205473] [2024-10-11 10:48:04,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:48:04,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:48:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:48:04,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [481651178] [2024-10-11 10:48:04,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:48:04,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:48:04,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:48:04,259 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:48:04,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 10:48:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:48:04,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:48:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:48:04,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:48:04,526 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:48:04,528 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:48:04,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 10:48:04,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:48:04,734 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 10:48:04,814 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:48:04,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:48:04 BoogieIcfgContainer [2024-10-11 10:48:04,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:48:04,818 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:48:04,818 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:48:04,819 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:48:04,819 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:47:53" (3/4) ... [2024-10-11 10:48:04,821 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:48:04,822 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:48:04,824 INFO L158 Benchmark]: Toolchain (without parser) took 12268.20ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 87.5MB in the beginning and 159.6MB in the end (delta: -72.0MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-10-11 10:48:04,824 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 103.4MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:48:04,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.14ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 72.8MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 10:48:04,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.12ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 70.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:48:04,826 INFO L158 Benchmark]: Boogie Preprocessor took 71.22ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 66.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:48:04,827 INFO L158 Benchmark]: RCFGBuilder took 621.98ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 66.5MB in the beginning and 140.7MB in the end (delta: -74.1MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2024-10-11 10:48:04,828 INFO L158 Benchmark]: TraceAbstraction took 11159.35ms. Allocated memory was 178.3MB in the beginning and 310.4MB in the end (delta: 132.1MB). Free memory was 139.5MB in the beginning and 159.6MB in the end (delta: -20.0MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. [2024-10-11 10:48:04,828 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 310.4MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:48:04,830 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.14ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 103.4MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.14ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 72.8MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.12ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 70.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.22ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 66.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 621.98ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 66.5MB in the beginning and 140.7MB in the end (delta: -74.1MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11159.35ms. Allocated memory was 178.3MB in the beginning and 310.4MB in the end (delta: 132.1MB). Free memory was 139.5MB in the beginning and 159.6MB in the end (delta: -20.0MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 310.4MB. Free memory is still 159.6MB. 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 someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 0.9; [L23] unsigned long int var_1_2 = 128; [L24] unsigned long int var_1_3 = 2941876006; [L25] unsigned long int var_1_5 = 256; [L26] float var_1_6 = 63.5; [L27] float var_1_7 = -0.151; [L28] float var_1_8 = 0.8; [L29] double var_1_9 = 9.5; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] unsigned char var_1_12 = 0; [L33] signed short int var_1_13 = -2; [L34] unsigned char var_1_16 = 10; [L35] unsigned short int var_1_17 = 8; [L36] unsigned char var_1_18 = 16; [L37] unsigned char last_1_var_1_16 = 10; [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L105] last_1_var_1_16 = var_1_16 [L115] RET updateLastVariables() [L116] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L74] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L74] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L75] var_1_3 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L76] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L77] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L77] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L78] var_1_5 = __VERIFIER_nondet_ulong() [L79] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L79] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L80] CALL assume_abort_if_not(var_1_5 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L80] RET assume_abort_if_not(var_1_5 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L81] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L81] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L82] var_1_6 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_8=4/5, var_1_9=19/2] [L83] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_8=4/5, var_1_9=19/2] [L84] var_1_7 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_8=4/5, var_1_9=19/2] [L85] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_8=4/5, var_1_9=19/2] [L86] var_1_8 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=19/2] [L87] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=19/2] [L88] var_1_9 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L89] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L90] var_1_11 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L91] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L92] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L92] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L93] var_1_12 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L94] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L95] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L95] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L96] var_1_17 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L97] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L98] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L98] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L99] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L99] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L100] var_1_18 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L101] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L102] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L102] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L116] RET updateVariables() [L117] CALL step() [L41] signed long int stepLocal_1 = last_1_var_1_16; [L42] unsigned long int stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_16=10, stepLocal_0=2147483647, stepLocal_1=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L43] COND TRUE stepLocal_1 <= (var_1_3 - last_1_var_1_16) VAL [isInitial=1, last_1_var_1_16=10, stepLocal_0=2147483647, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L44] COND FALSE !(stepLocal_0 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) [L49] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] [L52] COND TRUE var_1_1 < var_1_1 [L53] var_1_10 = (! (var_1_11 && var_1_12)) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] [L55] EXPR var_1_2 & (var_1_5 / var_1_17) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] [L55] unsigned long int stepLocal_2 = var_1_2 & (var_1_5 / var_1_17); [L56] COND FALSE !(stepLocal_2 > var_1_3) [L63] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] [L65] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR ((((last_1_var_1_16 <= (var_1_3 - last_1_var_1_16)) ? ((var_1_3 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) ? (((var_1_6 + var_1_7) > var_1_8) ? (var_1_1 == ((double) var_1_9)) : 1) : (var_1_1 == ((double) var_1_9))) : 1) && ((var_1_1 < var_1_1) ? (var_1_10 == ((unsigned char) (! (var_1_11 && var_1_12)))) : 1)) && (var_1_10 ? ((var_1_12 || (var_1_1 < (var_1_1 * var_1_1))) ? (var_1_13 == ((signed short int) (var_1_16 + var_1_16))) : 1) : 1)) && (((var_1_2 & (var_1_5 / var_1_17)) > var_1_3) ? ((! var_1_10) ? (var_1_16 == ((unsigned char) var_1_18)) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_18))) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] [L108-L109] return ((((last_1_var_1_16 <= (var_1_3 - last_1_var_1_16)) ? ((var_1_3 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) ? (((var_1_6 + var_1_7) > var_1_8) ? (var_1_1 == ((double) var_1_9)) : 1) : (var_1_1 == ((double) var_1_9))) : 1) && ((var_1_1 < var_1_1) ? (var_1_10 == ((unsigned char) (! (var_1_11 && var_1_12)))) : 1)) && (var_1_10 ? ((var_1_12 || (var_1_1 < (var_1_1 * var_1_1))) ? (var_1_13 == ((signed short int) (var_1_16 + var_1_16))) : 1) : 1)) && (((var_1_2 & (var_1_5 / var_1_17)) > var_1_3) ? ((! var_1_10) ? (var_1_16 == ((unsigned char) var_1_18)) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_18))) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 799 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 787 mSDsluCounter, 1400 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1129 mSDsCounter, 422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1524 IncrementalHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 422 mSolverCounterUnsat, 271 mSDtfsCounter, 1524 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 446 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=3, InterpolantAutomatonStates: 58, 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, 3 MinimizatonAttempts, 202 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 615 ConstructedInterpolants, 0 QuantifiedInterpolants, 3726 SizeOfPredicates, 10 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3668/3800 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-11 10:48:04,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 55e583a0a9f7f2653eed51c0b81d821a7cc045000a63c3ac74a8989888b39b3b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:48:07,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:48:07,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:48:07,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:48:07,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:48:07,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:48:07,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:48:07,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:48:07,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:48:07,310 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:48:07,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:48:07,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:48:07,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:48:07,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:48:07,312 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:48:07,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:48:07,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:48:07,313 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:48:07,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:48:07,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:48:07,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:48:07,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:48:07,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:48:07,317 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:48:07,317 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:48:07,317 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:48:07,318 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:48:07,318 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:48:07,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:48:07,319 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:48:07,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:48:07,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:48:07,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:48:07,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:48:07,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:48:07,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:48:07,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:48:07,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:48:07,322 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:48:07,322 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:48:07,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:48:07,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:48:07,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:48:07,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:48:07,323 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:48:07,324 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-clean/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-clean/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 -> 55e583a0a9f7f2653eed51c0b81d821a7cc045000a63c3ac74a8989888b39b3b [2024-10-11 10:48:07,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:48:07,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:48:07,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:48:07,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:48:07,710 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:48:07,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i [2024-10-11 10:48:09,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:48:09,653 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:48:09,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i [2024-10-11 10:48:09,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/23cef1920/62872d14e07040c5a84c0ff2a05b63db/FLAGc32f00403 [2024-10-11 10:48:09,676 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/23cef1920/62872d14e07040c5a84c0ff2a05b63db [2024-10-11 10:48:09,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:48:09,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:48:09,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:48:09,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:48:09,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:48:09,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:48:09" (1/1) ... [2024-10-11 10:48:09,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc3cccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:09, skipping insertion in model container [2024-10-11 10:48:09,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:48:09" (1/1) ... [2024-10-11 10:48:09,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:48:09,923 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i[917,930] [2024-10-11 10:48:09,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:48:10,008 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:48:10,021 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i[917,930] [2024-10-11 10:48:10,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:48:10,077 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:48:10,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:10 WrapperNode [2024-10-11 10:48:10,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:48:10,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:48:10,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:48:10,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:48:10,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:10" (1/1) ... [2024-10-11 10:48:10,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:10" (1/1) ... [2024-10-11 10:48:10,139 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-10-11 10:48:10,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:48:10,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:48:10,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:48:10,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:48:10,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:10" (1/1) ... [2024-10-11 10:48:10,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:10" (1/1) ... [2024-10-11 10:48:10,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:10" (1/1) ... [2024-10-11 10:48:10,178 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-11 10:48:10,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:10" (1/1) ... [2024-10-11 10:48:10,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:10" (1/1) ... [2024-10-11 10:48:10,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:10" (1/1) ... [2024-10-11 10:48:10,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:10" (1/1) ... [2024-10-11 10:48:10,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:10" (1/1) ... [2024-10-11 10:48:10,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:10" (1/1) ... [2024-10-11 10:48:10,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:48:10,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:48:10,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:48:10,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:48:10,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:10" (1/1) ... [2024-10-11 10:48:10,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:48:10,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:48:10,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:48:10,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:48:10,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:48:10,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:48:10,307 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:48:10,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:48:10,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:48:10,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:48:10,391 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:48:10,393 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:48:15,044 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 10:48:15,045 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:48:15,110 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:48:15,110 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:48:15,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:48:15 BoogieIcfgContainer [2024-10-11 10:48:15,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:48:15,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:48:15,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:48:15,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:48:15,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:48:09" (1/3) ... [2024-10-11 10:48:15,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740e244c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:48:15, skipping insertion in model container [2024-10-11 10:48:15,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:48:10" (2/3) ... [2024-10-11 10:48:15,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740e244c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:48:15, skipping insertion in model container [2024-10-11 10:48:15,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:48:15" (3/3) ... [2024-10-11 10:48:15,125 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-64.i [2024-10-11 10:48:15,144 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:48:15,144 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:48:15,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:48:15,230 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;@e2d35e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:48:15,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:48:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:48:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 10:48:15,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:48:15,252 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:48:15,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:48:15,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:48:15,260 INFO L85 PathProgramCache]: Analyzing trace with hash -757313963, now seen corresponding path program 1 times [2024-10-11 10:48:15,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:48:15,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754628987] [2024-10-11 10:48:15,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:48:15,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:48:15,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:48:15,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 10:48:15,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 10:48:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:48:15,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:48:15,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:48:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-10-11 10:48:15,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:48:15,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:48:15,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754628987] [2024-10-11 10:48:15,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754628987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:48:15,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:48:15,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:48:15,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763793293] [2024-10-11 10:48:15,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:48:15,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:48:15,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:48:15,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:48:15,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:48:15,892 INFO L87 Difference]: Start difference. First operand has 53 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:48:18,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:48:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:48:18,196 INFO L93 Difference]: Finished difference Result 103 states and 184 transitions. [2024-10-11 10:48:18,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:48:18,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2024-10-11 10:48:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:48:18,235 INFO L225 Difference]: With dead ends: 103 [2024-10-11 10:48:18,235 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 10:48:18,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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-11 10:48:18,240 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:48:18,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 10:48:18,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 10:48:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 10:48:18,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:48:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 77 transitions. [2024-10-11 10:48:18,282 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 77 transitions. Word has length 121 [2024-10-11 10:48:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:48:18,282 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 77 transitions. [2024-10-11 10:48:18,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:48:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 77 transitions. [2024-10-11 10:48:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 10:48:18,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:48:18,286 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:48:18,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 10:48:18,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 10:48:18,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:48:18,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:48:18,489 INFO L85 PathProgramCache]: Analyzing trace with hash -395390557, now seen corresponding path program 1 times [2024-10-11 10:48:18,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:48:18,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068304886] [2024-10-11 10:48:18,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:48:18,490 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-11 10:48:18,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:48:18,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 10:48:18,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 10:48:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:48:18,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 10:48:18,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:48:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:48:32,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:48:32,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:48:32,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068304886] [2024-10-11 10:48:32,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068304886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:48:32,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:48:32,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 10:48:32,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352374344] [2024-10-11 10:48:32,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:48:32,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:48:32,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:48:32,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:48:32,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:48:32,034 INFO L87 Difference]: Start difference. First operand 51 states and 77 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:48:35,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:48:36,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:48:37,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:48:39,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:48:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:48:39,481 INFO L93 Difference]: Finished difference Result 169 states and 253 transitions. [2024-10-11 10:48:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:48:39,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-11 10:48:39,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:48:39,515 INFO L225 Difference]: With dead ends: 169 [2024-10-11 10:48:39,515 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 10:48:39,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-11 10:48:39,517 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 82 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:48:39,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 339 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-10-11 10:48:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 10:48:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2024-10-11 10:48:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 10:48:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 145 transitions. [2024-10-11 10:48:39,541 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 145 transitions. Word has length 121 [2024-10-11 10:48:39,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:48:39,543 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 145 transitions. [2024-10-11 10:48:39,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:48:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 145 transitions. [2024-10-11 10:48:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 10:48:39,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:48:39,546 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:48:39,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 10:48:39,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 10:48:39,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:48:39,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:48:39,747 INFO L85 PathProgramCache]: Analyzing trace with hash 618059733, now seen corresponding path program 1 times [2024-10-11 10:48:39,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:48:39,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467201402] [2024-10-11 10:48:39,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:48:39,749 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-11 10:48:39,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:48:39,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 10:48:39,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:48:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:48:40,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:48:40,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:48:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:48:40,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:48:40,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:48:40,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467201402] [2024-10-11 10:48:40,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467201402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:48:40,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:48:40,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:48:40,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592037449] [2024-10-11 10:48:40,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:48:40,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:48:40,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:48:40,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:48:40,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:48:40,700 INFO L87 Difference]: Start difference. First operand 96 states and 145 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:48:42,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:48:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:48:42,522 INFO L93 Difference]: Finished difference Result 148 states and 223 transitions. [2024-10-11 10:48:42,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:48:42,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 122 [2024-10-11 10:48:42,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:48:42,559 INFO L225 Difference]: With dead ends: 148 [2024-10-11 10:48:42,559 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 10:48:42,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:48:42,561 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 10:48:42,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 10:48:42,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 10:48:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-11 10:48:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 10:48:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 138 transitions. [2024-10-11 10:48:42,577 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 138 transitions. Word has length 122 [2024-10-11 10:48:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:48:42,578 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 138 transitions. [2024-10-11 10:48:42,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:48:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 138 transitions. [2024-10-11 10:48:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 10:48:42,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:48:42,580 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:48:42,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 10:48:42,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 10:48:42,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:48:42,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:48:42,782 INFO L85 PathProgramCache]: Analyzing trace with hash -446278544, now seen corresponding path program 1 times [2024-10-11 10:48:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:48:42,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141351661] [2024-10-11 10:48:42,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:48:42,783 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-11 10:48:42,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:48:42,784 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 10:48:42,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 10:48:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:48:43,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 10:48:43,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:48:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-10-11 10:48:59,710 INFO L311 TraceCheckSpWp]: Computing backward predicates...