./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.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 59a501260da967ec7da4156f518c44b77b2b3a1718cb97e1e20f43e883a3b147 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:39:51,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:39:51,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:39:51,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:39:51,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:39:51,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:39:51,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:39:51,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:39:51,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:39:51,718 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:39:51,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:39:51,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:39:51,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:39:51,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:39:51,720 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:39:51,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:39:51,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:39:51,724 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:39:51,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:39:51,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:39:51,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:39:51,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:39:51,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:39:51,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:39:51,726 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:39:51,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:39:51,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:39:51,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:39:51,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:39:51,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:39:51,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:39:51,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:39:51,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:39:51,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:39:51,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:39:51,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:39:51,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:39:51,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:39:51,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:39:51,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:39:51,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:39:51,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:39:51,731 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 -> 59a501260da967ec7da4156f518c44b77b2b3a1718cb97e1e20f43e883a3b147 [2024-11-12 04:39:52,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:39:52,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:39:52,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:39:52,041 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:39:52,042 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:39:52,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i [2024-11-12 04:39:53,566 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:39:53,817 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:39:53,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i [2024-11-12 04:39:53,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f48d48fb5/50a981696e8647f98d5a938c82132733/FLAG4f82f0b46 [2024-11-12 04:39:53,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f48d48fb5/50a981696e8647f98d5a938c82132733 [2024-11-12 04:39:53,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:39:53,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:39:53,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:39:53,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:39:53,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:39:53,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:39:53" (1/1) ... [2024-11-12 04:39:53,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65b4f6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:53, skipping insertion in model container [2024-11-12 04:39:53,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:39:53" (1/1) ... [2024-11-12 04:39:53,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:39:54,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i[917,930] [2024-11-12 04:39:54,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:39:54,198 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:39:54,217 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i[917,930] [2024-11-12 04:39:54,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:39:54,264 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:39:54,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:54 WrapperNode [2024-11-12 04:39:54,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:39:54,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:39:54,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:39:54,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:39:54,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:54" (1/1) ... [2024-11-12 04:39:54,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:54" (1/1) ... [2024-11-12 04:39:54,320 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-12 04:39:54,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:39:54,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:39:54,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:39:54,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:39:54,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:54" (1/1) ... [2024-11-12 04:39:54,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:54" (1/1) ... [2024-11-12 04:39:54,337 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:54" (1/1) ... [2024-11-12 04:39:54,363 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:39:54,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:54" (1/1) ... [2024-11-12 04:39:54,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:54" (1/1) ... [2024-11-12 04:39:54,374 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:54" (1/1) ... [2024-11-12 04:39:54,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:54" (1/1) ... [2024-11-12 04:39:54,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:54" (1/1) ... [2024-11-12 04:39:54,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:54" (1/1) ... [2024-11-12 04:39:54,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:39:54,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:39:54,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:39:54,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:39:54,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:54" (1/1) ... [2024-11-12 04:39:54,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:39:54,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:39:54,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:39:54,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:39:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:39:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:39:54,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:39:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:39:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:39:54,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:39:54,577 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:39:54,580 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:39:54,846 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 04:39:54,846 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:39:54,858 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:39:54,859 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:39:54,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:39:54 BoogieIcfgContainer [2024-11-12 04:39:54,859 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:39:54,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:39:54,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:39:54,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:39:54,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:39:53" (1/3) ... [2024-11-12 04:39:54,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191d3679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:39:54, skipping insertion in model container [2024-11-12 04:39:54,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:39:54" (2/3) ... [2024-11-12 04:39:54,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191d3679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:39:54, skipping insertion in model container [2024-11-12 04:39:54,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:39:54" (3/3) ... [2024-11-12 04:39:54,867 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-53.i [2024-11-12 04:39:54,880 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:39:54,880 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:39:54,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:39:54,949 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;@37cf319f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:39:54,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:39:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:39:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 04:39:54,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:39:54,968 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:39:54,969 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:39:54,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:39:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash -678885089, now seen corresponding path program 1 times [2024-11-12 04:39:54,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:39:54,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716966761] [2024-11-12 04:39:54,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:39:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:39:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:39:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:39:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:39:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:39:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:39:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:39:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:39:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:39:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:39:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 04:39:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 04:39:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:39:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 04:39:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:39:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 04:39:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:39:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 04:39:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:39:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:39:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:39:55,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716966761] [2024-11-12 04:39:55,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716966761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:39:55,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:39:55,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:39:55,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005091685] [2024-11-12 04:39:55,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:39:55,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:39:55,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:39:55,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:39:55,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:39:55,425 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:39:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:39:55,458 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2024-11-12 04:39:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:39:55,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2024-11-12 04:39:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:39:55,485 INFO L225 Difference]: With dead ends: 101 [2024-11-12 04:39:55,488 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 04:39:55,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:39:55,498 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:39:55,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:39:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 04:39:55,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 04:39:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:39:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-12 04:39:55,592 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 113 [2024-11-12 04:39:55,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:39:55,594 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-12 04:39:55,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:39:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-12 04:39:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 04:39:55,600 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:39:55,600 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:39:55,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:39:55,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:39:55,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:39:55,602 INFO L85 PathProgramCache]: Analyzing trace with hash 10989083, now seen corresponding path program 1 times [2024-11-12 04:39:55,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:39:55,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182852397] [2024-11-12 04:39:55,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:39:55,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:39:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:39:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:39:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:39:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:39:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:39:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:39:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:39:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:39:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:39:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 04:39:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 04:39:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:39:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 04:39:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:39:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 04:39:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:39:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 04:39:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:39:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 129 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2024-11-12 04:39:57,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:39:57,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182852397] [2024-11-12 04:39:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182852397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:39:57,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310382240] [2024-11-12 04:39:57,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:39:57,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:39:57,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:39:57,669 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-11-12 04:39:57,671 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-11-12 04:39:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:39:57,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 04:39:57,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:39:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 182 proven. 153 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-11-12 04:39:59,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:40:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 156 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-12 04:40:01,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310382240] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:40:01,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 04:40:01,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 15] total 38 [2024-11-12 04:40:01,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588867326] [2024-11-12 04:40:01,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 04:40:01,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-12 04:40:01,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:40:01,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-12 04:40:01,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1002, Unknown=0, NotChecked=0, Total=1406 [2024-11-12 04:40:01,215 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 38 states, 35 states have (on average 2.857142857142857) internal successors, (100), 33 states have internal predecessors, (100), 14 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (54), 11 states have call predecessors, (54), 14 states have call successors, (54) [2024-11-12 04:40:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:40:02,427 INFO L93 Difference]: Finished difference Result 188 states and 256 transitions. [2024-11-12 04:40:02,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-12 04:40:02,428 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.857142857142857) internal successors, (100), 33 states have internal predecessors, (100), 14 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (54), 11 states have call predecessors, (54), 14 states have call successors, (54) Word has length 113 [2024-11-12 04:40:02,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:40:02,430 INFO L225 Difference]: With dead ends: 188 [2024-11-12 04:40:02,431 INFO L226 Difference]: Without dead ends: 141 [2024-11-12 04:40:02,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=697, Invalid=1753, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 04:40:02,433 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 275 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 04:40:02,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 405 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 04:40:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-12 04:40:02,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 122. [2024-11-12 04:40:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 77 states have internal predecessors, (91), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 04:40:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2024-11-12 04:40:02,465 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 163 transitions. Word has length 113 [2024-11-12 04:40:02,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:40:02,467 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 163 transitions. [2024-11-12 04:40:02,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.857142857142857) internal successors, (100), 33 states have internal predecessors, (100), 14 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (54), 11 states have call predecessors, (54), 14 states have call successors, (54) [2024-11-12 04:40:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 163 transitions. [2024-11-12 04:40:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 04:40:02,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:40:02,471 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:40:02,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 04:40:02,675 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-11-12 04:40:02,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:40:02,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:40:02,678 INFO L85 PathProgramCache]: Analyzing trace with hash -236601490, now seen corresponding path program 1 times [2024-11-12 04:40:02,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:40:02,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170289010] [2024-11-12 04:40:02,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:40:02,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:40:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:40:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:40:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:40:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:40:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:40:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:40:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:40:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:40:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:40:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 04:40:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 04:40:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 04:40:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 04:40:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:40:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 04:40:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:40:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 04:40:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:40:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 120 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-11-12 04:40:03,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:40:03,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170289010] [2024-11-12 04:40:03,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170289010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:40:03,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519252359] [2024-11-12 04:40:03,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:40:03,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:40:03,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:40:03,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:40:03,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 04:40:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:03,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 04:40:03,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:40:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 388 proven. 141 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-12 04:40:04,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:40:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 75 proven. 111 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-12 04:40:10,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519252359] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:40:10,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 04:40:10,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 14] total 31 [2024-11-12 04:40:10,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814180081] [2024-11-12 04:40:10,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 04:40:10,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-12 04:40:10,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:40:10,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-12 04:40:10,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2024-11-12 04:40:10,215 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. Second operand has 31 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 28 states have internal predecessors, (82), 12 states have call successors, (48), 6 states have call predecessors, (48), 13 states have return successors, (49), 12 states have call predecessors, (49), 12 states have call successors, (49) [2024-11-12 04:40:14,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:40:18,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:40:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:40:19,643 INFO L93 Difference]: Finished difference Result 275 states and 344 transitions. [2024-11-12 04:40:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 04:40:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 28 states have internal predecessors, (82), 12 states have call successors, (48), 6 states have call predecessors, (48), 13 states have return successors, (49), 12 states have call predecessors, (49), 12 states have call successors, (49) Word has length 114 [2024-11-12 04:40:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:40:19,646 INFO L225 Difference]: With dead ends: 275 [2024-11-12 04:40:19,646 INFO L226 Difference]: Without dead ends: 156 [2024-11-12 04:40:19,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=489, Invalid=1151, Unknown=0, NotChecked=0, Total=1640 [2024-11-12 04:40:19,649 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 76 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 45 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-12 04:40:19,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 189 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 387 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-11-12 04:40:19,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-12 04:40:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2024-11-12 04:40:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 91 states have (on average 1.0769230769230769) internal successors, (98), 91 states have internal predecessors, (98), 36 states have call successors, (36), 16 states have call predecessors, (36), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 04:40:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2024-11-12 04:40:19,673 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 114 [2024-11-12 04:40:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:40:19,674 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2024-11-12 04:40:19,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 28 states have internal predecessors, (82), 12 states have call successors, (48), 6 states have call predecessors, (48), 13 states have return successors, (49), 12 states have call predecessors, (49), 12 states have call successors, (49) [2024-11-12 04:40:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2024-11-12 04:40:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 04:40:19,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:40:19,676 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:40:19,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 04:40:19,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-12 04:40:19,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:40:19,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:40:19,877 INFO L85 PathProgramCache]: Analyzing trace with hash -916659860, now seen corresponding path program 1 times [2024-11-12 04:40:19,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:40:19,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766409843] [2024-11-12 04:40:19,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:40:19,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:40:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:40:19,970 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:40:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:40:20,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:40:20,067 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:40:20,068 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:40:20,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 04:40:20,075 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 04:40:20,163 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:40:20,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:40:20 BoogieIcfgContainer [2024-11-12 04:40:20,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:40:20,166 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:40:20,166 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:40:20,167 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:40:20,167 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:39:54" (3/4) ... [2024-11-12 04:40:20,172 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:40:20,174 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:40:20,175 INFO L158 Benchmark]: Toolchain (without parser) took 26322.53ms. Allocated memory was 123.7MB in the beginning and 327.2MB in the end (delta: 203.4MB). Free memory was 54.0MB in the beginning and 267.6MB in the end (delta: -213.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:40:20,175 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 123.7MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:40:20,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.80ms. Allocated memory was 123.7MB in the beginning and 167.8MB in the end (delta: 44.0MB). Free memory was 53.7MB in the beginning and 131.2MB in the end (delta: -77.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 04:40:20,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.49ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 128.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:40:20,176 INFO L158 Benchmark]: Boogie Preprocessor took 75.87ms. Allocated memory is still 167.8MB. Free memory was 128.1MB in the beginning and 124.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:40:20,176 INFO L158 Benchmark]: RCFGBuilder took 461.51ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 107.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 04:40:20,177 INFO L158 Benchmark]: TraceAbstraction took 25304.34ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 106.0MB in the beginning and 268.7MB in the end (delta: -162.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:40:20,177 INFO L158 Benchmark]: Witness Printer took 8.03ms. Allocated memory is still 327.2MB. Free memory was 268.7MB in the beginning and 267.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:40:20,180 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.24ms. Allocated memory is still 123.7MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.80ms. Allocated memory was 123.7MB in the beginning and 167.8MB in the end (delta: 44.0MB). Free memory was 53.7MB in the beginning and 131.2MB in the end (delta: -77.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.49ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 128.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.87ms. Allocated memory is still 167.8MB. Free memory was 128.1MB in the beginning and 124.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 461.51ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 107.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25304.34ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 106.0MB in the beginning and 268.7MB in the end (delta: -162.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 8.03ms. Allocated memory is still 327.2MB. Free memory was 268.7MB in the beginning and 267.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_3 = 1456677701; [L24] unsigned long int var_1_4 = 1000000000; [L25] unsigned long int var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 0; [L29] double var_1_9 = 256.5; [L30] double var_1_10 = 8.8; [L31] unsigned char var_1_11 = 1; [L32] unsigned short int var_1_12 = 16; [L33] unsigned long int var_1_13 = 3110219175; [L34] unsigned short int var_1_14 = 128; [L35] unsigned char var_1_15 = 1; [L36] unsigned char var_1_16 = 0; VAL [isInitial=0, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] FCALL updateLastVariables() [L107] CALL updateVariables() [L67] var_1_3 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L70] var_1_4 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L72] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L72] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L73] var_1_5 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L74] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L75] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=513/2] [L76] var_1_7 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0, var_1_9=513/2] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L80] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=44/5, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L82] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L84] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L85] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=3110219175, var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L86] var_1_13 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L87] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L88] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L88] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=128, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L89] var_1_14 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L90] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L91] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L91] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L93] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L94] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L94] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L107] RET updateVariables() [L108] CALL step() [L40] var_1_6 = var_1_7 VAL [isInitial=1, var_1_11=1, var_1_12=16, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L41] COND TRUE var_1_5 <= (var_1_13 - var_1_4) [L42] var_1_12 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L44] COND TRUE (var_1_9 * 16.5f) > var_1_10 [L45] var_1_15 = (! var_1_11) VAL [isInitial=1, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=0, var_1_16=1, var_1_1=5, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L49] var_1_1 = (var_1_12 + (var_1_3 - (var_1_4 - var_1_12))) [L50] signed long int stepLocal_1 = (((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)); [L51] unsigned long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=1073741823, stepLocal_1=0, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=0, var_1_16=1, var_1_1=-4294967296, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L52] COND TRUE stepLocal_1 != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))) VAL [isInitial=1, stepLocal_0=1073741823, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=0, var_1_16=1, var_1_1=-4294967296, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L53] COND FALSE !(var_1_9 == var_1_10) VAL [isInitial=1, stepLocal_0=1073741823, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=0, var_1_16=1, var_1_1=-4294967296, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L108] RET step() [L109] CALL, EXPR property() [L99-L100] return ((((var_1_1 == ((unsigned long int) (var_1_12 + (var_1_3 - (var_1_4 - var_1_12))))) && (var_1_6 == ((unsigned char) var_1_7))) && ((((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12))) != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) ? ((var_1_9 == var_1_10) ? (var_1_6 ? ((var_1_3 >= var_1_12) ? (var_1_8 == ((unsigned char) (var_1_7 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_7))) : 1) : 1) : (var_1_8 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_13 - var_1_4)) ? (var_1_12 == ((unsigned short int) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))) : 1)) && (((var_1_9 * 16.5f) > var_1_10) ? (var_1_15 == ((unsigned char) (! var_1_11))) : (var_1_15 == ((unsigned char) (var_1_11 && var_1_16)))) ; VAL [\result=0, isInitial=1, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=0, var_1_16=1, var_1_1=-4294967296, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=0, var_1_16=1, var_1_1=-4294967296, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=1, var_1_12=0, var_1_13=-(((__int128) 1 << 64) | 4611686007689969665), var_1_14=0, var_1_15=0, var_1_16=1, var_1_1=-4294967296, var_1_3=1073741823, var_1_4=5368709119, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.2s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 351 mSDsluCounter, 667 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 497 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1041 IncrementalHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 170 mSDtfsCounter, 1041 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 624 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=3, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 681 NumberOfCodeBlocks, 681 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 7457 SizeOfPredicates, 14 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 3474/4284 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 04:40:20,222 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.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 59a501260da967ec7da4156f518c44b77b2b3a1718cb97e1e20f43e883a3b147 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:40:22,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:40:22,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:40:22,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:40:22,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:40:22,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:40:22,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:40:22,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:40:22,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:40:22,485 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:40:22,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:40:22,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:40:22,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:40:22,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:40:22,488 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:40:22,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:40:22,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:40:22,492 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:40:22,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:40:22,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:40:22,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:40:22,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:40:22,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:40:22,494 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:40:22,494 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:40:22,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:40:22,495 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:40:22,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:40:22,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:40:22,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:40:22,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:40:22,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:40:22,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:40:22,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:40:22,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:40:22,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:40:22,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:40:22,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:40:22,498 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:40:22,498 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:40:22,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:40:22,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:40:22,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:40:22,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:40:22,501 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 -> 59a501260da967ec7da4156f518c44b77b2b3a1718cb97e1e20f43e883a3b147 [2024-11-12 04:40:22,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:40:22,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:40:22,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:40:22,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:40:22,880 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:40:22,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i [2024-11-12 04:40:24,537 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:40:24,774 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:40:24,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i [2024-11-12 04:40:24,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07af1c7e0/5c3e85e4080e4674b2d6d6006f3507d4/FLAG948678563 [2024-11-12 04:40:24,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07af1c7e0/5c3e85e4080e4674b2d6d6006f3507d4 [2024-11-12 04:40:24,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:40:24,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:40:24,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:40:24,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:40:24,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:40:24,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:40:24" (1/1) ... [2024-11-12 04:40:24,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6127b561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:24, skipping insertion in model container [2024-11-12 04:40:24,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:40:24" (1/1) ... [2024-11-12 04:40:24,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:40:25,029 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i[917,930] [2024-11-12 04:40:25,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:40:25,110 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:40:25,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-53.i[917,930] [2024-11-12 04:40:25,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:40:25,210 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:40:25,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:25 WrapperNode [2024-11-12 04:40:25,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:40:25,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:40:25,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:40:25,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:40:25,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:25" (1/1) ... [2024-11-12 04:40:25,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:25" (1/1) ... [2024-11-12 04:40:25,272 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-12 04:40:25,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:40:25,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:40:25,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:40:25,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:40:25,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:25" (1/1) ... [2024-11-12 04:40:25,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:25" (1/1) ... [2024-11-12 04:40:25,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:25" (1/1) ... [2024-11-12 04:40:25,311 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:40:25,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:25" (1/1) ... [2024-11-12 04:40:25,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:25" (1/1) ... [2024-11-12 04:40:25,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:25" (1/1) ... [2024-11-12 04:40:25,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:25" (1/1) ... [2024-11-12 04:40:25,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:25" (1/1) ... [2024-11-12 04:40:25,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:25" (1/1) ... [2024-11-12 04:40:25,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:40:25,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:40:25,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:40:25,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:40:25,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:25" (1/1) ... [2024-11-12 04:40:25,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:40:25,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:40:25,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:40:25,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:40:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:40:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:40:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:40:25,411 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:40:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:40:25,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:40:25,486 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:40:25,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:40:26,068 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 04:40:26,068 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:40:26,084 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:40:26,084 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:40:26,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:40:26 BoogieIcfgContainer [2024-11-12 04:40:26,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:40:26,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:40:26,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:40:26,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:40:26,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:40:24" (1/3) ... [2024-11-12 04:40:26,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f53f1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:40:26, skipping insertion in model container [2024-11-12 04:40:26,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:40:25" (2/3) ... [2024-11-12 04:40:26,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f53f1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:40:26, skipping insertion in model container [2024-11-12 04:40:26,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:40:26" (3/3) ... [2024-11-12 04:40:26,097 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-53.i [2024-11-12 04:40:26,114 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:40:26,114 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:40:26,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:40:26,216 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;@405db143, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:40:26,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:40:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:40:26,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 04:40:26,233 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:40:26,234 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:40:26,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:40:26,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:40:26,241 INFO L85 PathProgramCache]: Analyzing trace with hash -678885089, now seen corresponding path program 1 times [2024-11-12 04:40:26,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:40:26,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66821686] [2024-11-12 04:40:26,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:40:26,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:40:26,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:40:26,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:40:26,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 04:40:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:26,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:40:26,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:40:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-12 04:40:26,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:40:26,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:40:26,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66821686] [2024-11-12 04:40:26,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66821686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:40:26,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:40:26,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:40:26,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746114047] [2024-11-12 04:40:26,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:40:26,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:40:26,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:40:26,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:40:26,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:40:26,576 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:40:26,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:40:26,611 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2024-11-12 04:40:26,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:40:26,613 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2024-11-12 04:40:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:40:26,622 INFO L225 Difference]: With dead ends: 101 [2024-11-12 04:40:26,622 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 04:40:26,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:40:26,631 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:40:26,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:40:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 04:40:26,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 04:40:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:40:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-12 04:40:26,674 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 113 [2024-11-12 04:40:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:40:26,675 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-12 04:40:26,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:40:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-12 04:40:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 04:40:26,678 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:40:26,678 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:40:26,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 04:40:26,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:40:26,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:40:26,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:40:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash 10989083, now seen corresponding path program 1 times [2024-11-12 04:40:26,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:40:26,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746996059] [2024-11-12 04:40:26,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:40:26,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:40:26,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:40:26,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:40:26,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 04:40:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:27,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 04:40:27,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:40:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 80 proven. 168 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 04:40:28,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:40:28,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:40:28,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746996059] [2024-11-12 04:40:28,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746996059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:40:28,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1588729702] [2024-11-12 04:40:28,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:40:28,909 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 04:40:28,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 04:40:28,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 04:40:28,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-12 04:40:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:40:29,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 04:40:29,366 INFO L279 TraceCheckSpWp]: Computing forward predicates...