./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-24.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-24.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 2ed7cb0d7dd44f90c8f2664b0f68587fb54e832248476997225ec2aff393c799 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:51:08,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:51:08,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:51:08,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:51:08,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:51:08,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:51:08,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:51:08,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:51:08,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:51:08,518 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:51:08,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:51:08,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:51:08,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:51:08,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:51:08,520 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:51:08,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:51:08,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:51:08,521 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:51:08,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:51:08,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:51:08,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:51:08,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:51:08,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:51:08,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:51:08,525 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:51:08,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:51:08,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:51:08,526 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:51:08,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:51:08,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:51:08,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:51:08,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:51:08,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:51:08,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:51:08,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:51:08,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:51:08,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:51:08,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:51:08,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:51:08,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:51:08,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:51:08,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:51:08,530 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 -> 2ed7cb0d7dd44f90c8f2664b0f68587fb54e832248476997225ec2aff393c799 [2024-10-14 10:51:08,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:51:08,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:51:08,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:51:08,780 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:51:08,780 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:51:08,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-24.i [2024-10-14 10:51:10,268 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:51:10,438 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:51:10,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-24.i [2024-10-14 10:51:10,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078cb204c/faba71b4a0bb4474ba71ac7b33097ad0/FLAG46e665827 [2024-10-14 10:51:10,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078cb204c/faba71b4a0bb4474ba71ac7b33097ad0 [2024-10-14 10:51:10,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:51:10,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:51:10,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:51:10,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:51:10,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:51:10,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:51:10" (1/1) ... [2024-10-14 10:51:10,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bdced54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:10, skipping insertion in model container [2024-10-14 10:51:10,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:51:10" (1/1) ... [2024-10-14 10:51:10,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:51:10,649 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-24.i[917,930] [2024-10-14 10:51:10,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:51:10,706 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:51:10,716 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-24.i[917,930] [2024-10-14 10:51:10,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:51:10,751 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:51:10,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:10 WrapperNode [2024-10-14 10:51:10,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:51:10,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:51:10,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:51:10,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:51:10,771 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:51:10" (1/1) ... [2024-10-14 10:51:10,779 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:51:10" (1/1) ... [2024-10-14 10:51:10,810 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-10-14 10:51:10,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:51:10,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:51:10,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:51:10,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:51:10,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:10" (1/1) ... [2024-10-14 10:51:10,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:10" (1/1) ... [2024-10-14 10:51:10,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:10" (1/1) ... [2024-10-14 10:51:10,840 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:51:10,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:10" (1/1) ... [2024-10-14 10:51:10,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:10" (1/1) ... [2024-10-14 10:51:10,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:10" (1/1) ... [2024-10-14 10:51:10,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:10" (1/1) ... [2024-10-14 10:51:10,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:10" (1/1) ... [2024-10-14 10:51:10,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:10" (1/1) ... [2024-10-14 10:51:10,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:51:10,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:51:10,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:51:10,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:51:10,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:10" (1/1) ... [2024-10-14 10:51:10,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:51:10,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:51:10,958 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:51:10,969 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:51:11,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:51:11,003 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:51:11,003 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:51:11,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:51:11,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:51:11,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:51:11,089 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:51:11,091 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:51:11,288 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 10:51:11,288 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:51:11,318 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:51:11,319 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:51:11,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:51:11 BoogieIcfgContainer [2024-10-14 10:51:11,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:51:11,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:51:11,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:51:11,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:51:11,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:51:10" (1/3) ... [2024-10-14 10:51:11,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c06f0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:51:11, skipping insertion in model container [2024-10-14 10:51:11,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:10" (2/3) ... [2024-10-14 10:51:11,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c06f0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:51:11, skipping insertion in model container [2024-10-14 10:51:11,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:51:11" (3/3) ... [2024-10-14 10:51:11,325 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-24.i [2024-10-14 10:51:11,338 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:51:11,338 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:51:11,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:51:11,405 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;@51c61ebb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:51:11,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:51:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 10:51:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 10:51:11,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:51:11,420 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:11,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:51:11,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:51:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash 965612790, now seen corresponding path program 1 times [2024-10-14 10:51:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:51:11,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978728686] [2024-10-14 10:51:11,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:51:11,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:51:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:51:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:51:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:51:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:51:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:51:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:51:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:51:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:51:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:51:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:51:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:51:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:51:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:51:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:51:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:51:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 10:51:11,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:51:11,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978728686] [2024-10-14 10:51:11,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978728686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:51:11,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:51:11,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:51:11,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030035667] [2024-10-14 10:51:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:51:11,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:51:11,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:51:11,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:51:11,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:51:11,812 INFO L87 Difference]: Start difference. First operand has 41 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 10:51:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:51:11,851 INFO L93 Difference]: Finished difference Result 79 states and 137 transitions. [2024-10-14 10:51:11,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:51:11,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 92 [2024-10-14 10:51:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:51:11,873 INFO L225 Difference]: With dead ends: 79 [2024-10-14 10:51:11,877 INFO L226 Difference]: Without dead ends: 39 [2024-10-14 10:51:11,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:51:11,888 INFO L432 NwaCegarLoop]: 54 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, 54 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:51:11,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:51:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-14 10:51:11,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-14 10:51:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 10:51:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2024-10-14 10:51:11,942 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 92 [2024-10-14 10:51:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:51:11,942 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2024-10-14 10:51:11,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 10:51:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2024-10-14 10:51:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 10:51:11,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:51:11,947 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:11,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:51:11,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:51:11,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:51:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1609989192, now seen corresponding path program 1 times [2024-10-14 10:51:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:51:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098450525] [2024-10-14 10:51:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:51:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:51:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:51:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:51:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:51:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:51:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:51:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:51:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:51:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:51:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:51:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:51:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:51:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:51:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:51:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:51:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:51:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 10:51:12,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:51:12,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098450525] [2024-10-14 10:51:12,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098450525] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:51:12,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655567625] [2024-10-14 10:51:12,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:51:12,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:51:12,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:51:12,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:51:12,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 10:51:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:12,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 10:51:12,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:51:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 18 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-14 10:51:13,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:51:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 10:51:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655567625] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:51:13,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 10:51:13,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-10-14 10:51:13,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731552107] [2024-10-14 10:51:13,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 10:51:13,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 10:51:13,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:51:13,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 10:51:13,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-14 10:51:13,470 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-14 10:51:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:51:14,192 INFO L93 Difference]: Finished difference Result 184 states and 247 transitions. [2024-10-14 10:51:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-14 10:51:14,193 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 92 [2024-10-14 10:51:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:51:14,195 INFO L225 Difference]: With dead ends: 184 [2024-10-14 10:51:14,195 INFO L226 Difference]: Without dead ends: 146 [2024-10-14 10:51:14,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 209 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=366, Invalid=966, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 10:51:14,197 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 151 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:51:14,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 233 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:51:14,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-14 10:51:14,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 93. [2024-10-14 10:51:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 56 states have internal predecessors, (62), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 10:51:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2024-10-14 10:51:14,245 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 92 [2024-10-14 10:51:14,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:51:14,246 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2024-10-14 10:51:14,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-14 10:51:14,246 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2024-10-14 10:51:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 10:51:14,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:51:14,248 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:14,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 10:51:14,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:51:14,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:51:14,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:51:14,454 INFO L85 PathProgramCache]: Analyzing trace with hash 165018170, now seen corresponding path program 1 times [2024-10-14 10:51:14,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:51:14,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967068816] [2024-10-14 10:51:14,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:51:14,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:51:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:51:14,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:51:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:51:14,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:51:14,574 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:51:14,576 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:51:14,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:51:14,580 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 10:51:14,645 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:51:14,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:51:14 BoogieIcfgContainer [2024-10-14 10:51:14,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:51:14,650 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:51:14,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:51:14,650 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:51:14,651 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:51:11" (3/4) ... [2024-10-14 10:51:14,652 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:51:14,653 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:51:14,654 INFO L158 Benchmark]: Toolchain (without parser) took 4191.90ms. Allocated memory was 167.8MB in the beginning and 272.6MB in the end (delta: 104.9MB). Free memory was 96.0MB in the beginning and 205.7MB in the end (delta: -109.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:51:14,656 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:51:14,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.03ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 82.6MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 10:51:14,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.37ms. Allocated memory is still 167.8MB. Free memory was 82.6MB in the beginning and 80.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 10:51:14,656 INFO L158 Benchmark]: Boogie Preprocessor took 48.17ms. Allocated memory is still 167.8MB. Free memory was 80.1MB in the beginning and 76.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 10:51:14,657 INFO L158 Benchmark]: RCFGBuilder took 459.11ms. Allocated memory is still 167.8MB. Free memory was 76.8MB in the beginning and 120.7MB in the end (delta: -43.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 10:51:14,657 INFO L158 Benchmark]: TraceAbstraction took 3328.73ms. Allocated memory was 167.8MB in the beginning and 272.6MB in the end (delta: 104.9MB). Free memory was 119.4MB in the beginning and 205.7MB in the end (delta: -86.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-10-14 10:51:14,657 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 272.6MB. Free memory is still 205.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:51:14,659 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.03ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 82.6MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.37ms. Allocated memory is still 167.8MB. Free memory was 82.6MB in the beginning and 80.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.17ms. Allocated memory is still 167.8MB. Free memory was 80.1MB in the beginning and 76.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 459.11ms. Allocated memory is still 167.8MB. Free memory was 76.8MB in the beginning and 120.7MB in the end (delta: -43.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3328.73ms. Allocated memory was 167.8MB in the beginning and 272.6MB in the end (delta: 104.9MB). Free memory was 119.4MB in the beginning and 205.7MB in the end (delta: -86.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 272.6MB. Free memory is still 205.7MB. 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 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_4 = 16; [L25] signed char var_1_5 = 4; [L26] signed char var_1_6 = 0; [L27] unsigned short int var_1_7 = 0; [L28] unsigned short int var_1_10 = 55182; [L29] unsigned char var_1_12 = 0; [L30] unsigned char var_1_14 = 1; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 100; [L33] float var_1_17 = 2.25; [L34] float var_1_18 = 199.4; [L35] signed char var_1_19 = -128; [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=16, var_1_5=4, var_1_6=0, var_1_7=0] [L64] var_1_4 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L65] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L66] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L66] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=4, var_1_6=0, var_1_7=0] [L67] var_1_5 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=0, var_1_7=0] [L68] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=0, var_1_7=0] [L69] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=0, var_1_7=0] [L69] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=0, var_1_7=0] [L70] var_1_6 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L71] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L72] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L72] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=55182, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L73] var_1_10 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L74] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L75] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L75] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L77] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L79] var_1_15 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L80] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L81] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L81] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_18=997/5, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L82] var_1_18 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L83] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L96] RET updateVariables() [L97] CALL step() [L39] COND FALSE !(! var_1_2) [L42] var_1_12 = ((! var_1_15) || (! (! 0))) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=100, var_1_17=9/4, var_1_19=-128, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L44] var_1_16 = var_1_5 [L45] var_1_17 = var_1_18 [L46] var_1_19 = var_1_4 VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=124, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=32, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L47] COND FALSE !(var_1_12 || (64.75f < var_1_17)) [L54] var_1_1 = var_1_4 VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=124, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=0] [L56] COND TRUE (((((var_1_17 * 127.75)) > ((var_1_17 / 3.4))) ? ((var_1_17 * 127.75)) : ((var_1_17 / 3.4)))) >= var_1_17 [L57] var_1_7 = (((((var_1_10 - (22925 - var_1_5))) < (var_1_16)) ? ((var_1_10 - (22925 - var_1_5))) : (var_1_16))) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=124, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=124] [L97] RET step() [L98] CALL, EXPR property() [L88-L89] return ((((((var_1_12 || (64.75f < var_1_17)) ? (var_1_12 ? (var_1_1 == ((signed char) (var_1_4 - var_1_5))) : (var_1_1 == ((signed char) ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) < (var_1_6)) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6)))))) : (var_1_1 == ((signed char) var_1_4))) && (((((((var_1_17 * 127.75)) > ((var_1_17 / 3.4))) ? ((var_1_17 * 127.75)) : ((var_1_17 / 3.4)))) >= var_1_17) ? (var_1_7 == ((unsigned short int) (((((var_1_10 - (22925 - var_1_5))) < (var_1_16)) ? ((var_1_10 - (22925 - var_1_5))) : (var_1_16))))) : 1)) && ((! var_1_2) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) ((! var_1_15) || (! (! 0))))))) && (var_1_16 == ((unsigned char) var_1_5))) && (var_1_17 == ((float) var_1_18))) && (var_1_19 == ((signed char) var_1_4)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=124, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=124] [L19] reach_error() VAL [isInitial=1, var_1_10=32767, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=124, var_1_17=55187, var_1_18=55187, var_1_19=125, var_1_1=125, var_1_2=1, var_1_4=125, var_1_5=124, var_1_6=126, var_1_7=124] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 287 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 366 IncrementalHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 119 mSDtfsCounter, 366 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 256 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=2, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 53 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 950 SizeOfPredicates, 3 NumberOfNonLiveVariables, 223 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1638/1680 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:51:14,686 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-24.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 2ed7cb0d7dd44f90c8f2664b0f68587fb54e832248476997225ec2aff393c799 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:51:16,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:51:17,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:51:17,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:51:17,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:51:17,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:51:17,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:51:17,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:51:17,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:51:17,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:51:17,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:51:17,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:51:17,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:51:17,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:51:17,085 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:51:17,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:51:17,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:51:17,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:51:17,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:51:17,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:51:17,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:51:17,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:51:17,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:51:17,091 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:51:17,091 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:51:17,091 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:51:17,091 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:51:17,092 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:51:17,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:51:17,092 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:51:17,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:51:17,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:51:17,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:51:17,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:51:17,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:51:17,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:51:17,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:51:17,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:51:17,094 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:51:17,096 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:51:17,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:51:17,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:51:17,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:51:17,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:51:17,098 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:51:17,098 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 -> 2ed7cb0d7dd44f90c8f2664b0f68587fb54e832248476997225ec2aff393c799 [2024-10-14 10:51:17,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:51:17,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:51:17,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:51:17,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:51:17,457 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:51:17,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-24.i [2024-10-14 10:51:19,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:51:19,366 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:51:19,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-24.i [2024-10-14 10:51:19,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8324f0d2c/d107bca81b9f40239d85d649b0d96772/FLAG22380782a [2024-10-14 10:51:19,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8324f0d2c/d107bca81b9f40239d85d649b0d96772 [2024-10-14 10:51:19,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:51:19,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:51:19,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:51:19,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:51:19,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:51:19,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:51:19" (1/1) ... [2024-10-14 10:51:19,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677606e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:19, skipping insertion in model container [2024-10-14 10:51:19,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:51:19" (1/1) ... [2024-10-14 10:51:19,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:51:19,905 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-24.i[917,930] [2024-10-14 10:51:19,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:51:19,987 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:51:20,003 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-24.i[917,930] [2024-10-14 10:51:20,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:51:20,051 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:51:20,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:20 WrapperNode [2024-10-14 10:51:20,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:51:20,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:51:20,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:51:20,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:51:20,060 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:51:20" (1/1) ... [2024-10-14 10:51:20,072 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:51:20" (1/1) ... [2024-10-14 10:51:20,114 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-10-14 10:51:20,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:51:20,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:51:20,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:51:20,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:51:20,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:20" (1/1) ... [2024-10-14 10:51:20,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:20" (1/1) ... [2024-10-14 10:51:20,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:20" (1/1) ... [2024-10-14 10:51:20,159 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:51:20,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:51:20" (1/1) ... [2024-10-14 10:51:20,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:51:20" (1/1) ... [2024-10-14 10:51:20,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:51:20" (1/1) ... [2024-10-14 10:51:20,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:20" (1/1) ... [2024-10-14 10:51:20,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:20" (1/1) ... [2024-10-14 10:51:20,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:20" (1/1) ... [2024-10-14 10:51:20,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:51:20,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:51:20,194 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:51:20,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:51:20,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:20" (1/1) ... [2024-10-14 10:51:20,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:51:20,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:51:20,231 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:51:20,235 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:51:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:51:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:51:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:51:20,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:51:20,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:51:20,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:51:20,369 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:51:20,371 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:51:33,069 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 10:51:33,070 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:51:33,116 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:51:33,119 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:51:33,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:51:33 BoogieIcfgContainer [2024-10-14 10:51:33,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:51:33,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:51:33,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:51:33,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:51:33,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:51:19" (1/3) ... [2024-10-14 10:51:33,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d898f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:51:33, skipping insertion in model container [2024-10-14 10:51:33,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:51:20" (2/3) ... [2024-10-14 10:51:33,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d898f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:51:33, skipping insertion in model container [2024-10-14 10:51:33,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:51:33" (3/3) ... [2024-10-14 10:51:33,128 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-24.i [2024-10-14 10:51:33,144 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:51:33,144 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:51:33,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:51:33,223 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;@643be2d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:51:33,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:51:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 10:51:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 10:51:33,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:51:33,237 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:33,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:51:33,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:51:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash 965612790, now seen corresponding path program 1 times [2024-10-14 10:51:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:51:33,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142042872] [2024-10-14 10:51:33,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:51:33,257 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:51:33,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:51:33,264 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:51:33,271 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:51:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:34,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:51:34,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:51:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-14 10:51:34,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:51:34,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:51:34,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142042872] [2024-10-14 10:51:34,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142042872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:51:34,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:51:34,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:51:34,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224201479] [2024-10-14 10:51:34,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:51:34,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:51:34,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:51:34,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:51:34,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:51:34,135 INFO L87 Difference]: Start difference. First operand has 41 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 10:51:38,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:51:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:51:38,468 INFO L93 Difference]: Finished difference Result 79 states and 137 transitions. [2024-10-14 10:51:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:51:38,581 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 92 [2024-10-14 10:51:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:51:38,586 INFO L225 Difference]: With dead ends: 79 [2024-10-14 10:51:38,586 INFO L226 Difference]: Without dead ends: 39 [2024-10-14 10:51:38,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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:51:38,591 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:51:38,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-14 10:51:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-14 10:51:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-14 10:51:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 10:51:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2024-10-14 10:51:38,624 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 92 [2024-10-14 10:51:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:51:38,624 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2024-10-14 10:51:38,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 10:51:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2024-10-14 10:51:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 10:51:38,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:51:38,627 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:38,651 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:51:38,828 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:51:38,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:51:38,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:51:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1609989192, now seen corresponding path program 1 times [2024-10-14 10:51:38,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:51:38,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221695243] [2024-10-14 10:51:38,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:51:38,830 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:51:38,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:51:38,849 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:51:38,853 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:51:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:51:39,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 10:51:39,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:51:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 18 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-14 10:51:42,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:51:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 10:51:44,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:51:44,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221695243] [2024-10-14 10:51:44,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221695243] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:51:44,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 10:51:44,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-10-14 10:51:44,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863365639] [2024-10-14 10:51:44,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 10:51:44,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 10:51:44,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:51:44,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 10:51:44,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 10:51:44,535 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-14 10:51:52,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:51:56,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:52:00,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:52:04,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:52:08,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:52:12,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:52:16,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:52:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:52:22,829 INFO L93 Difference]: Finished difference Result 180 states and 244 transitions. [2024-10-14 10:52:22,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 10:52:22,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 92 [2024-10-14 10:52:22,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:52:22,832 INFO L225 Difference]: With dead ends: 180 [2024-10-14 10:52:22,832 INFO L226 Difference]: Without dead ends: 142 [2024-10-14 10:52:22,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 10:52:22,834 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 111 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 90 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2024-10-14 10:52:22,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 250 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 395 Invalid, 6 Unknown, 0 Unchecked, 34.7s Time] [2024-10-14 10:52:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-14 10:52:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 50. [2024-10-14 10:52:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 10:52:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-10-14 10:52:22,848 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 92 [2024-10-14 10:52:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:52:22,849 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-10-14 10:52:22,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-14 10:52:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-10-14 10:52:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 10:52:22,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:52:22,850 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:22,871 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 (3)] Ended with exit code 0 [2024-10-14 10:52:23,054 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:52:23,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:52:23,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:52:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash 165018170, now seen corresponding path program 1 times [2024-10-14 10:52:23,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:52:23,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576437486] [2024-10-14 10:52:23,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:52:23,057 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:52:23,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:52:23,059 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:52:23,061 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:52:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:52:23,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 10:52:23,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:52:36,365 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 10:52:44,464 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 10:52:52,821 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)