./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-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-49.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80b841c5351f7559458077a7f3466da52c119d100c994b143348346583d98b3d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:54:18,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:54:18,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:54:18,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:54:18,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:54:18,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:54:18,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:54:18,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:54:18,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:54:18,150 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:54:18,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:54:18,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:54:18,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:54:18,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:54:18,152 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:54:18,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:54:18,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:54:18,159 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:54:18,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:54:18,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:54:18,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:54:18,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:54:18,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:54:18,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:54:18,161 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:54:18,161 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:54:18,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:54:18,164 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:54:18,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:54:18,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:54:18,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:54:18,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:54:18,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:54:18,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:54:18,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:54:18,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:54:18,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:54:18,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:54:18,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:54:18,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:54:18,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:54:18,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:54:18,168 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 80b841c5351f7559458077a7f3466da52c119d100c994b143348346583d98b3d [2024-10-14 10:54:18,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:54:18,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:54:18,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:54:18,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:54:18,486 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:54:18,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-49.i [2024-10-14 10:54:19,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:54:20,114 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:54:20,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-49.i [2024-10-14 10:54:20,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b88d7dc18/9e2896b752a04805b1ccf325f243e009/FLAGd7334da92 [2024-10-14 10:54:20,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b88d7dc18/9e2896b752a04805b1ccf325f243e009 [2024-10-14 10:54:20,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:54:20,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:54:20,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:54:20,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:54:20,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:54:20,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:54:20" (1/1) ... [2024-10-14 10:54:20,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0cbfa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20, skipping insertion in model container [2024-10-14 10:54:20,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:54:20" (1/1) ... [2024-10-14 10:54:20,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:54:20,625 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-49.i[917,930] [2024-10-14 10:54:20,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:54:20,689 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:54:20,703 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-49.i[917,930] [2024-10-14 10:54:20,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:54:20,764 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:54:20,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20 WrapperNode [2024-10-14 10:54:20,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:54:20,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:54:20,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:54:20,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:54:20,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20" (1/1) ... [2024-10-14 10:54:20,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20" (1/1) ... [2024-10-14 10:54:20,822 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-10-14 10:54:20,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:54:20,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:54:20,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:54:20,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:54:20,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20" (1/1) ... [2024-10-14 10:54:20,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20" (1/1) ... [2024-10-14 10:54:20,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20" (1/1) ... [2024-10-14 10:54:20,867 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 10:54:20,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20" (1/1) ... [2024-10-14 10:54:20,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20" (1/1) ... [2024-10-14 10:54:20,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20" (1/1) ... [2024-10-14 10:54:20,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20" (1/1) ... [2024-10-14 10:54:20,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20" (1/1) ... [2024-10-14 10:54:20,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20" (1/1) ... [2024-10-14 10:54:20,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:54:20,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:54:20,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:54:20,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:54:20,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20" (1/1) ... [2024-10-14 10:54:20,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:54:20,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:54:20,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 10:54:20,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 10:54:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:54:20,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:54:20,995 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:54:20,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:54:20,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:54:20,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:54:21,073 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:54:21,075 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:54:21,389 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 10:54:21,389 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:54:21,417 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:54:21,417 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:54:21,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:54:21 BoogieIcfgContainer [2024-10-14 10:54:21,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:54:21,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:54:21,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:54:21,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:54:21,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:54:20" (1/3) ... [2024-10-14 10:54:21,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139faf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:54:21, skipping insertion in model container [2024-10-14 10:54:21,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:20" (2/3) ... [2024-10-14 10:54:21,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139faf3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:54:21, skipping insertion in model container [2024-10-14 10:54:21,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:54:21" (3/3) ... [2024-10-14 10:54:21,427 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-49.i [2024-10-14 10:54:21,443 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:54:21,443 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:54:21,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:54:21,526 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;@5412f1b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:54:21,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:54:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 10:54:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 10:54:21,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:54:21,546 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:54:21,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:54:21,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:54:21,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1192061334, now seen corresponding path program 1 times [2024-10-14 10:54:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:54:21,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27511272] [2024-10-14 10:54:21,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:54:21,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:54:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:54:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:54:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:54:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 10:54:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:54:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:54:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:54:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 10:54:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:54:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:54:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:54:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:54:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:54:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:54:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 10:54:21,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:54:21,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27511272] [2024-10-14 10:54:21,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27511272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:54:21,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:54:21,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:54:21,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330361461] [2024-10-14 10:54:21,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:54:21,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:54:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:54:21,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:54:21,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:54:21,963 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 10:54:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:54:21,996 INFO L93 Difference]: Finished difference Result 93 states and 158 transitions. [2024-10-14 10:54:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:54:22,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 89 [2024-10-14 10:54:22,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:54:22,008 INFO L225 Difference]: With dead ends: 93 [2024-10-14 10:54:22,009 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 10:54:22,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:54:22,020 INFO L432 NwaCegarLoop]: 65 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, 65 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:54:22,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:54:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 10:54:22,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 10:54:22,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 10:54:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2024-10-14 10:54:22,064 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 89 [2024-10-14 10:54:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:54:22,066 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2024-10-14 10:54:22,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 10:54:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2024-10-14 10:54:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 10:54:22,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:54:22,072 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:54:22,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:54:22,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:54:22,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:54:22,074 INFO L85 PathProgramCache]: Analyzing trace with hash 646983962, now seen corresponding path program 1 times [2024-10-14 10:54:22,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:54:22,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265956925] [2024-10-14 10:54:22,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:54:22,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:54:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:54:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:54:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:54:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 10:54:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:54:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:54:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:54:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 10:54:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:54:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:54:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:54:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:54:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:54:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:54:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-14 10:54:22,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:54:22,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265956925] [2024-10-14 10:54:22,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265956925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:54:22,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:54:22,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:54:22,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754937124] [2024-10-14 10:54:22,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:54:22,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:54:22,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:54:22,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:54:22,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:54:22,625 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 10:54:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:54:22,815 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2024-10-14 10:54:22,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 10:54:22,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2024-10-14 10:54:22,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:54:22,821 INFO L225 Difference]: With dead ends: 99 [2024-10-14 10:54:22,821 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 10:54:22,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:54:22,825 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 48 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:54:22,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 109 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:54:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 10:54:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-10-14 10:54:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 10:54:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2024-10-14 10:54:22,843 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 89 [2024-10-14 10:54:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:54:22,844 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2024-10-14 10:54:22,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 10:54:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2024-10-14 10:54:22,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 10:54:22,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:54:22,847 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:54:22,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:54:22,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:54:22,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:54:22,849 INFO L85 PathProgramCache]: Analyzing trace with hash -597246003, now seen corresponding path program 1 times [2024-10-14 10:54:22,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:54:22,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972015554] [2024-10-14 10:54:22,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:54:22,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:54:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:54:22,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:54:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:54:22,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:54:22,976 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:54:22,977 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:54:22,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:54:22,981 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 10:54:23,045 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:54:23,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:54:23 BoogieIcfgContainer [2024-10-14 10:54:23,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:54:23,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:54:23,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:54:23,053 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:54:23,054 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:54:21" (3/4) ... [2024-10-14 10:54:23,056 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:54:23,057 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:54:23,060 INFO L158 Benchmark]: Toolchain (without parser) took 2599.47ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 153.3MB in the beginning and 129.7MB in the end (delta: 23.6MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2024-10-14 10:54:23,060 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:54:23,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.74ms. Allocated memory is still 184.5MB. Free memory was 153.3MB in the beginning and 138.6MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 10:54:23,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.50ms. Allocated memory is still 184.5MB. Free memory was 138.6MB in the beginning and 134.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 10:54:23,061 INFO L158 Benchmark]: Boogie Preprocessor took 76.02ms. Allocated memory is still 184.5MB. Free memory was 134.4MB in the beginning and 126.8MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 10:54:23,062 INFO L158 Benchmark]: RCFGBuilder took 517.38ms. Allocated memory is still 184.5MB. Free memory was 126.8MB in the beginning and 104.4MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 10:54:23,062 INFO L158 Benchmark]: TraceAbstraction took 1630.45ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 103.7MB in the beginning and 130.8MB in the end (delta: -27.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2024-10-14 10:54:23,063 INFO L158 Benchmark]: Witness Printer took 4.48ms. Allocated memory is still 241.2MB. Free memory was 130.8MB in the beginning and 129.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:54:23,065 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.74ms. Allocated memory is still 184.5MB. Free memory was 153.3MB in the beginning and 138.6MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.50ms. Allocated memory is still 184.5MB. Free memory was 138.6MB in the beginning and 134.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.02ms. Allocated memory is still 184.5MB. Free memory was 134.4MB in the beginning and 126.8MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 517.38ms. Allocated memory is still 184.5MB. Free memory was 126.8MB in the beginning and 104.4MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1630.45ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 103.7MB in the beginning and 130.8MB in the end (delta: -27.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * Witness Printer took 4.48ms. Allocated memory is still 241.2MB. Free memory was 130.8MB in the beginning and 129.7MB in the end (delta: 1.0MB). 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 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 4; [L23] float var_1_2 = 1000000000.4; [L24] float var_1_3 = 1000.2; [L25] unsigned short int var_1_4 = 256; [L26] unsigned short int var_1_5 = 4; [L27] unsigned short int var_1_6 = 10; [L28] signed short int var_1_8 = 128; [L29] signed short int var_1_9 = -2; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] unsigned char var_1_12 = 0; [L33] unsigned char var_1_13 = 1; [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_float() [L66] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L66] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_3=5001/5, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L67] var_1_3 = __VERIFIER_nondet_float() [L68] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L68] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L69] var_1_4 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L70] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L71] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L71] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L72] var_1_5 = __VERIFIER_nondet_ushort() [L73] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L73] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L74] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L74] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L75] var_1_6 = __VERIFIER_nondet_ushort() [L76] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_8=128, var_1_9=-2] [L76] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_8=128, var_1_9=-2] [L77] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-2] [L77] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=-2] [L78] var_1_9 = __VERIFIER_nondet_short() [L79] CALL assume_abort_if_not(var_1_9 >= -32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L79] RET assume_abort_if_not(var_1_9 >= -32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L80] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L80] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L81] var_1_11 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L82] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L83] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L83] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L84] var_1_12 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L85] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L86] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L86] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=128, var_1_9=32766] [L99] RET updateVariables() [L100] CALL step() [L37] var_1_8 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=32766] [L38] EXPR 50 >> var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=32766] [L38] COND TRUE (50 >> var_1_4) <= var_1_8 [L39] var_1_10 = ((! (! var_1_11)) || var_1_12) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=32766] [L43] COND TRUE ! var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=32766] [L44] COND TRUE var_1_4 >= ((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) [L45] var_1_13 = (var_1_10 && var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=32766] [L50] COND FALSE !(var_1_2 >= 64.5f) [L61] var_1_1 = 50 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=32766] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR (((var_1_2 >= 64.5f) ? ((var_1_2 >= var_1_3) ? (var_1_1 == ((unsigned short int) (((((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) < 0 ) ? -((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : ((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))))))) : (var_1_13 ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) var_1_6)))) : (var_1_1 == ((unsigned short int) 50))) && (var_1_8 == ((signed short int) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && (((50 >> var_1_4) <= var_1_8) ? (var_1_10 == ((unsigned char) ((! (! var_1_11)) || var_1_12))) : (var_1_10 == ((unsigned char) (! var_1_11)))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=32766] [L91-L92] return ((((var_1_2 >= 64.5f) ? ((var_1_2 >= var_1_3) ? (var_1_1 == ((unsigned short int) (((((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) < 0 ) ? -((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : ((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))))))) : (var_1_13 ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) var_1_6)))) : (var_1_1 == ((unsigned short int) 50))) && (var_1_8 == ((signed short int) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && (((50 >> var_1_4) <= var_1_8) ? (var_1_10 == ((unsigned char) ((! (! var_1_11)) || var_1_12))) : (var_1_10 == ((unsigned char) (! var_1_11))))) && ((! var_1_12) ? ((var_1_4 >= ((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8)))) ? (var_1_13 == ((unsigned char) (var_1_10 && var_1_11))) : (var_1_13 == ((unsigned char) var_1_11))) : 1) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=32766] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=32766, var_1_9=32766] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 111 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 728/728 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 10:54:23,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-49.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80b841c5351f7559458077a7f3466da52c119d100c994b143348346583d98b3d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:54:25,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:54:25,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:54:25,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:54:25,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:54:25,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:54:25,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:54:25,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:54:25,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:54:25,524 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:54:25,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:54:25,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:54:25,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:54:25,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:54:25,530 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:54:25,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:54:25,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:54:25,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:54:25,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:54:25,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:54:25,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:54:25,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:54:25,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:54:25,533 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:54:25,533 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:54:25,534 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:54:25,534 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:54:25,534 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:54:25,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:54:25,534 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:54:25,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:54:25,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:54:25,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:54:25,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:54:25,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:54:25,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:54:25,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:54:25,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:54:25,538 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:54:25,539 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:54:25,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:54:25,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:54:25,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:54:25,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:54:25,540 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:54:25,540 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 80b841c5351f7559458077a7f3466da52c119d100c994b143348346583d98b3d [2024-10-14 10:54:25,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:54:25,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:54:25,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:54:25,899 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:54:25,900 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:54:25,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-49.i [2024-10-14 10:54:27,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:54:27,649 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:54:27,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-49.i [2024-10-14 10:54:27,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1c3ce2b/d85662fbea9741e5b1e7995c71a617ce/FLAG8a3183463 [2024-10-14 10:54:27,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1c3ce2b/d85662fbea9741e5b1e7995c71a617ce [2024-10-14 10:54:27,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:54:27,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:54:27,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:54:27,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:54:27,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:54:27,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:54:27" (1/1) ... [2024-10-14 10:54:27,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4130be74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:27, skipping insertion in model container [2024-10-14 10:54:27,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:54:27" (1/1) ... [2024-10-14 10:54:27,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:54:27,908 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-49.i[917,930] [2024-10-14 10:54:27,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:54:27,996 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:54:28,009 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-49.i[917,930] [2024-10-14 10:54:28,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:54:28,065 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:54:28,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:28 WrapperNode [2024-10-14 10:54:28,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:54:28,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:54:28,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:54:28,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:54:28,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:28" (1/1) ... [2024-10-14 10:54:28,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:28" (1/1) ... [2024-10-14 10:54:28,125 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-10-14 10:54:28,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:54:28,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:54:28,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:54:28,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:54:28,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:28" (1/1) ... [2024-10-14 10:54:28,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:28" (1/1) ... [2024-10-14 10:54:28,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:28" (1/1) ... [2024-10-14 10:54:28,157 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 10:54:28,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:28" (1/1) ... [2024-10-14 10:54:28,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:28" (1/1) ... [2024-10-14 10:54:28,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:28" (1/1) ... [2024-10-14 10:54:28,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:28" (1/1) ... [2024-10-14 10:54:28,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:28" (1/1) ... [2024-10-14 10:54:28,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:28" (1/1) ... [2024-10-14 10:54:28,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:54:28,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:54:28,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:54:28,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:54:28,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:28" (1/1) ... [2024-10-14 10:54:28,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:54:28,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:54:28,225 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 10:54:28,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 10:54:28,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:54:28,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:54:28,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:54:28,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:54:28,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:54:28,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:54:28,346 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:54:28,356 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:54:28,626 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 10:54:28,626 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:54:28,698 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:54:28,699 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:54:28,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:54:28 BoogieIcfgContainer [2024-10-14 10:54:28,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:54:28,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:54:28,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:54:28,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:54:28,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:54:27" (1/3) ... [2024-10-14 10:54:28,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a2b049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:54:28, skipping insertion in model container [2024-10-14 10:54:28,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:54:28" (2/3) ... [2024-10-14 10:54:28,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a2b049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:54:28, skipping insertion in model container [2024-10-14 10:54:28,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:54:28" (3/3) ... [2024-10-14 10:54:28,710 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-49.i [2024-10-14 10:54:28,730 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:54:28,730 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:54:28,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:54:28,824 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;@1fb891e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:54:28,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:54:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 10:54:28,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 10:54:28,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:54:28,842 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:54:28,843 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:54:28,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:54:28,850 INFO L85 PathProgramCache]: Analyzing trace with hash -523332478, now seen corresponding path program 1 times [2024-10-14 10:54:28,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:54:28,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856082667] [2024-10-14 10:54:28,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:54:28,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:54:28,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:54:28,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:54:28,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 10:54:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:29,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:54:29,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:54:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-10-14 10:54:29,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:54:29,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:54:29,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856082667] [2024-10-14 10:54:29,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856082667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:54:29,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:54:29,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:54:29,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163103763] [2024-10-14 10:54:29,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:54:29,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:54:29,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:54:29,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:54:29,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:54:29,154 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 10:54:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:54:29,190 INFO L93 Difference]: Finished difference Result 79 states and 138 transitions. [2024-10-14 10:54:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:54:29,193 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2024-10-14 10:54:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:54:29,200 INFO L225 Difference]: With dead ends: 79 [2024-10-14 10:54:29,200 INFO L226 Difference]: Without dead ends: 39 [2024-10-14 10:54:29,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:54:29,211 INFO L432 NwaCegarLoop]: 55 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, 55 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:54:29,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:54:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-14 10:54:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-14 10:54:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 10:54:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2024-10-14 10:54:29,251 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 86 [2024-10-14 10:54:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:54:29,252 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2024-10-14 10:54:29,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 10:54:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2024-10-14 10:54:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 10:54:29,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:54:29,255 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:54:29,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 10:54:29,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:54:29,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:54:29,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:54:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1412995966, now seen corresponding path program 1 times [2024-10-14 10:54:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:54:29,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709638604] [2024-10-14 10:54:29,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:54:29,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:54:29,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:54:29,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:54:29,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 10:54:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:29,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 10:54:29,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:54:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-14 10:54:29,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:54:29,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:54:29,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709638604] [2024-10-14 10:54:29,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709638604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:54:29,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:54:29,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:54:29,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607037270] [2024-10-14 10:54:29,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:54:29,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:54:29,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:54:29,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:54:29,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:54:29,759 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 10:54:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:54:30,005 INFO L93 Difference]: Finished difference Result 85 states and 122 transitions. [2024-10-14 10:54:30,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 10:54:30,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2024-10-14 10:54:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:54:30,008 INFO L225 Difference]: With dead ends: 85 [2024-10-14 10:54:30,009 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 10:54:30,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:54:30,011 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 39 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:54:30,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 81 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:54:30,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 10:54:30,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2024-10-14 10:54:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 10:54:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2024-10-14 10:54:30,025 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 86 [2024-10-14 10:54:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:54:30,026 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2024-10-14 10:54:30,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 10:54:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2024-10-14 10:54:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 10:54:30,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:54:30,031 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:54:30,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 10:54:30,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:54:30,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:54:30,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:54:30,234 INFO L85 PathProgramCache]: Analyzing trace with hash 602057148, now seen corresponding path program 1 times [2024-10-14 10:54:30,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:54:30,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617211035] [2024-10-14 10:54:30,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:54:30,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:54:30,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:54:30,238 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:54:30,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 10:54:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:54:30,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 10:54:30,373 INFO L278 TraceCheckSpWp]: Computing forward predicates...