./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:40:44,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:40:44,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 00:40:44,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:40:44,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:40:44,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:40:44,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:40:44,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:40:44,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:40:44,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:40:44,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:40:44,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:40:44,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:40:44,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:40:44,497 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:40:44,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:40:44,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:40:44,498 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:40:44,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 00:40:44,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:40:44,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:40:44,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:40:44,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:40:44,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:40:44,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:40:44,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:40:44,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:40:44,500 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:40:44,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:40:44,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:40:44,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:40:44,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:40:44,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:40:44,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:40:44,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:40:44,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:40:44,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 00:40:44,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 00:40:44,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:40:44,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:40:44,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:40:44,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:40:44,504 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b [2024-10-11 00:40:44,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:40:44,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:40:44,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:40:44,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:40:44,763 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:40:44,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2024-10-11 00:40:46,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:40:46,370 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:40:46,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2024-10-11 00:40:46,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/860d3e668/eb8b028a29f34493bbcfb9f346fde62f/FLAG798186453 [2024-10-11 00:40:46,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/860d3e668/eb8b028a29f34493bbcfb9f346fde62f [2024-10-11 00:40:46,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:40:46,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:40:46,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:40:46,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:40:46,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:40:46,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:40:46" (1/1) ... [2024-10-11 00:40:46,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e92236d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46, skipping insertion in model container [2024-10-11 00:40:46,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:40:46" (1/1) ... [2024-10-11 00:40:46,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:40:46,597 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c[1765,1778] [2024-10-11 00:40:46,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:40:46,609 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:40:46,638 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c[1765,1778] [2024-10-11 00:40:46,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:40:46,657 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:40:46,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46 WrapperNode [2024-10-11 00:40:46,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:40:46,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:40:46,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:40:46,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:40:46,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46" (1/1) ... [2024-10-11 00:40:46,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46" (1/1) ... [2024-10-11 00:40:46,696 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 49 [2024-10-11 00:40:46,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:40:46,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:40:46,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:40:46,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:40:46,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46" (1/1) ... [2024-10-11 00:40:46,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46" (1/1) ... [2024-10-11 00:40:46,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46" (1/1) ... [2024-10-11 00:40:46,717 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-11 00:40:46,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46" (1/1) ... [2024-10-11 00:40:46,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46" (1/1) ... [2024-10-11 00:40:46,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46" (1/1) ... [2024-10-11 00:40:46,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46" (1/1) ... [2024-10-11 00:40:46,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46" (1/1) ... [2024-10-11 00:40:46,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46" (1/1) ... [2024-10-11 00:40:46,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:40:46,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:40:46,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:40:46,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:40:46,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46" (1/1) ... [2024-10-11 00:40:46,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:40:46,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:40:46,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:40:46,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:40:46,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:40:46,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 00:40:46,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 00:40:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 00:40:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-10-11 00:40:46,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-10-11 00:40:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 00:40:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 00:40:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:40:46,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:40:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 00:40:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 00:40:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 00:40:46,878 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:40:46,879 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:40:47,022 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-11 00:40:47,022 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:40:47,043 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:40:47,043 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 00:40:47,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:40:47 BoogieIcfgContainer [2024-10-11 00:40:47,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:40:47,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:40:47,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:40:47,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:40:47,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:40:46" (1/3) ... [2024-10-11 00:40:47,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4c090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:40:47, skipping insertion in model container [2024-10-11 00:40:47,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:46" (2/3) ... [2024-10-11 00:40:47,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4c090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:40:47, skipping insertion in model container [2024-10-11 00:40:47,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:40:47" (3/3) ... [2024-10-11 00:40:47,050 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2024-10-11 00:40:47,064 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:40:47,064 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:40:47,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:40:47,119 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;@67f60501, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:40:47,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:40:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:40:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 00:40:47,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:47,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:47,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:47,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:47,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2044067822, now seen corresponding path program 1 times [2024-10-11 00:40:47,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:40:47,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203715312] [2024-10-11 00:40:47,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:47,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:40:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:47,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 00:40:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:47,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:40:47,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203715312] [2024-10-11 00:40:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203715312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:47,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:40:47,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536972729] [2024-10-11 00:40:47,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:47,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:40:47,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:40:47,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:40:47,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:40:47,362 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:47,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:47,404 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2024-10-11 00:40:47,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:40:47,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-11 00:40:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:47,421 INFO L225 Difference]: With dead ends: 45 [2024-10-11 00:40:47,421 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 00:40:47,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:40:47,433 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:47,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:40:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 00:40:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 00:40:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:40:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-10-11 00:40:47,470 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 13 [2024-10-11 00:40:47,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:47,470 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-11 00:40:47,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2024-10-11 00:40:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 00:40:47,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:47,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:47,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 00:40:47,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:47,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1170290553, now seen corresponding path program 1 times [2024-10-11 00:40:47,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:40:47,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744386381] [2024-10-11 00:40:47,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:47,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:40:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:47,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 00:40:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:47,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:40:47,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744386381] [2024-10-11 00:40:47,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744386381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:47,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:47,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 00:40:47,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836731380] [2024-10-11 00:40:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:47,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 00:40:47,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:40:47,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 00:40:47,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:47,746 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:47,775 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-10-11 00:40:47,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 00:40:47,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 00:40:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:47,777 INFO L225 Difference]: With dead ends: 29 [2024-10-11 00:40:47,777 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 00:40:47,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:47,779 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:47,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 81 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:40:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 00:40:47,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-11 00:40:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:40:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-10-11 00:40:47,786 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 14 [2024-10-11 00:40:47,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:47,786 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-11 00:40:47,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-10-11 00:40:47,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 00:40:47,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:47,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:47,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 00:40:47,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:47,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:47,789 INFO L85 PathProgramCache]: Analyzing trace with hash -421055317, now seen corresponding path program 1 times [2024-10-11 00:40:47,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:40:47,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733057903] [2024-10-11 00:40:47,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:47,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:40:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:47,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 00:40:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:47,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:40:47,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733057903] [2024-10-11 00:40:47,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733057903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:47,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:47,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 00:40:47,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141256713] [2024-10-11 00:40:47,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:47,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 00:40:47,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:40:47,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 00:40:47,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:47,906 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:47,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:47,945 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-10-11 00:40:47,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 00:40:47,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 00:40:47,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:47,946 INFO L225 Difference]: With dead ends: 33 [2024-10-11 00:40:47,947 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 00:40:47,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:47,948 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:47,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:40:47,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 00:40:47,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-10-11 00:40:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:40:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-10-11 00:40:47,957 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 15 [2024-10-11 00:40:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:47,957 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-11 00:40:47,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-10-11 00:40:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 00:40:47,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:47,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:47,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 00:40:47,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:47,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash 168137013, now seen corresponding path program 1 times [2024-10-11 00:40:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:40:47,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525581427] [2024-10-11 00:40:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:40:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:48,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 00:40:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:48,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:40:48,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525581427] [2024-10-11 00:40:48,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525581427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:48,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:48,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 00:40:48,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56916551] [2024-10-11 00:40:48,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:48,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 00:40:48,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:40:48,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 00:40:48,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:48,099 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:48,145 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-10-11 00:40:48,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 00:40:48,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 00:40:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:48,147 INFO L225 Difference]: With dead ends: 33 [2024-10-11 00:40:48,147 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 00:40:48,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:48,149 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:48,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:40:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 00:40:48,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-10-11 00:40:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:40:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-10-11 00:40:48,162 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2024-10-11 00:40:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:48,163 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-11 00:40:48,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-10-11 00:40:48,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 00:40:48,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:48,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:48,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 00:40:48,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:48,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:48,164 INFO L85 PathProgramCache]: Analyzing trace with hash -365463193, now seen corresponding path program 1 times [2024-10-11 00:40:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:40:48,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273583192] [2024-10-11 00:40:48,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:40:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:48,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 00:40:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:48,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:40:48,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273583192] [2024-10-11 00:40:48,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273583192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:48,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:48,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 00:40:48,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819737930] [2024-10-11 00:40:48,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:48,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 00:40:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:40:48,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 00:40:48,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:48,320 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:48,360 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-10-11 00:40:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 00:40:48,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 00:40:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:48,362 INFO L225 Difference]: With dead ends: 33 [2024-10-11 00:40:48,363 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 00:40:48,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:40:48,364 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:48,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:40:48,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 00:40:48,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-10-11 00:40:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:40:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-10-11 00:40:48,378 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2024-10-11 00:40:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:48,380 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-11 00:40:48,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-10-11 00:40:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 00:40:48,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:48,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:48,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 00:40:48,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:48,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1377347142, now seen corresponding path program 1 times [2024-10-11 00:40:48,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:40:48,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714091623] [2024-10-11 00:40:48,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:48,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:40:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 00:40:48,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 00:40:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 00:40:48,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 00:40:48,456 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 00:40:48,457 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 00:40:48,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 00:40:48,462 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 00:40:48,486 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 00:40:48,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:40:48 BoogieIcfgContainer [2024-10-11 00:40:48,492 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 00:40:48,493 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 00:40:48,493 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 00:40:48,493 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 00:40:48,494 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:40:47" (3/4) ... [2024-10-11 00:40:48,496 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 00:40:48,497 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 00:40:48,498 INFO L158 Benchmark]: Toolchain (without parser) took 2098.59ms. Allocated memory was 134.2MB in the beginning and 192.9MB in the end (delta: 58.7MB). Free memory was 64.9MB in the beginning and 91.4MB in the end (delta: -26.5MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-10-11 00:40:48,498 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory was 100.1MB in the beginning and 100.0MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:40:48,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.90ms. Allocated memory was 134.2MB in the beginning and 192.9MB in the end (delta: 58.7MB). Free memory was 64.8MB in the beginning and 163.7MB in the end (delta: -98.9MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2024-10-11 00:40:48,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.05ms. Allocated memory is still 192.9MB. Free memory was 163.7MB in the beginning and 164.1MB in the end (delta: -475.8kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 00:40:48,500 INFO L158 Benchmark]: Boogie Preprocessor took 29.99ms. Allocated memory is still 192.9MB. Free memory was 164.1MB in the beginning and 162.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:40:48,500 INFO L158 Benchmark]: RCFGBuilder took 315.70ms. Allocated memory is still 192.9MB. Free memory was 162.0MB in the beginning and 147.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 00:40:48,500 INFO L158 Benchmark]: TraceAbstraction took 1446.95ms. Allocated memory is still 192.9MB. Free memory was 146.4MB in the beginning and 92.5MB in the end (delta: 53.9MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2024-10-11 00:40:48,501 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 192.9MB. Free memory was 92.5MB in the beginning and 91.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:40:48,502 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.13ms. Allocated memory is still 134.2MB. Free memory was 100.1MB in the beginning and 100.0MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.90ms. Allocated memory was 134.2MB in the beginning and 192.9MB in the end (delta: 58.7MB). Free memory was 64.8MB in the beginning and 163.7MB in the end (delta: -98.9MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.05ms. Allocated memory is still 192.9MB. Free memory was 163.7MB in the beginning and 164.1MB in the end (delta: -475.8kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.99ms. Allocated memory is still 192.9MB. Free memory was 164.1MB in the beginning and 162.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 315.70ms. Allocated memory is still 192.9MB. Free memory was 162.0MB in the beginning and 147.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1446.95ms. Allocated memory is still 192.9MB. Free memory was 146.4MB in the beginning and 92.5MB in the end (delta: 53.9MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 192.9MB. Free memory was 92.5MB in the beginning and 91.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 70]: 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 69, overapproximation of someBinaryArithmeticDOUBLEoperation at line 63. Possible FailurePath: [L62] double x = __VERIFIER_nondet_double(); [L63] double y = 0.0 / 0.0; [L64] CALL, EXPR isnan_double(x) [L18] return x != x; [L64] RET, EXPR isnan_double(x) [L64] COND TRUE !isnan_double(x) [L66] CALL, EXPR fmin_double(x, y) [L47] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967307] [L20] __uint32_t msw, lsw; VAL [\old(x)=4294967307, x=4294967307] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L29-L30] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967307, lsw=4294967297, msw=4293918721, x=4294967307] [L32-L33] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967307, lsw=4294967297, msw=4293918721, x=4294967307] [L35-L36] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967307, lsw=4294967297, msw=4293918721, x=4294967307] [L39-L40] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L43] return 0; VAL [\old(x)=4294967307, \result=0, x=4294967307] [L47] RET, EXPR __fpclassify_double(x) VAL [x=4294967307, y=4294967306] [L47] COND TRUE __fpclassify_double(x) == 0 [L48] return y; VAL [\result=4294967306, x=4294967307] [L66] RET, EXPR fmin_double(x, y) [L66] double res = fmin_double(x, y); [L69] COND TRUE res != x [L70] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 425 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 290 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101 IncrementalHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 135 mSDtfsCounter, 101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=2, InterpolantAutomatonStates: 23, 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, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 00:40:48,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:40:50,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:40:50,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 00:40:50,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:40:50,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:40:50,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:40:50,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:40:50,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:40:50,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:40:50,939 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:40:50,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:40:50,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:40:50,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:40:50,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:40:50,942 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:40:50,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:40:50,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:40:50,943 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:40:50,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:40:50,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:40:50,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:40:50,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:40:50,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:40:50,944 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 00:40:50,944 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 00:40:50,945 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:40:50,945 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 00:40:50,945 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:40:50,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:40:50,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:40:50,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:40:50,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:40:50,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:40:50,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:40:50,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:40:50,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:40:50,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:40:50,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:40:50,947 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 00:40:50,947 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 00:40:50,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:40:50,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:40:50,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:40:50,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:40:50,948 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 00:40:50,948 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b [2024-10-11 00:40:51,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:40:51,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:40:51,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:40:51,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:40:51,260 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:40:51,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2024-10-11 00:40:52,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:40:53,008 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:40:53,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2024-10-11 00:40:53,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8812030fb/6cfcde48a6114c6392550c59fcc1bdbd/FLAG8da779370 [2024-10-11 00:40:53,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8812030fb/6cfcde48a6114c6392550c59fcc1bdbd [2024-10-11 00:40:53,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:40:53,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:40:53,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:40:53,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:40:53,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:40:53,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:40:53" (1/1) ... [2024-10-11 00:40:53,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f89df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53, skipping insertion in model container [2024-10-11 00:40:53,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:40:53" (1/1) ... [2024-10-11 00:40:53,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:40:53,294 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c[1765,1778] [2024-10-11 00:40:53,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:40:53,306 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:40:53,321 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c[1765,1778] [2024-10-11 00:40:53,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:40:53,337 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:40:53,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53 WrapperNode [2024-10-11 00:40:53,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:40:53,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:40:53,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:40:53,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:40:53,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53" (1/1) ... [2024-10-11 00:40:53,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53" (1/1) ... [2024-10-11 00:40:53,364 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2024-10-11 00:40:53,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:40:53,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:40:53,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:40:53,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:40:53,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53" (1/1) ... [2024-10-11 00:40:53,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53" (1/1) ... [2024-10-11 00:40:53,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53" (1/1) ... [2024-10-11 00:40:53,385 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [3, 2]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 1 writes are split as follows [1, 0]. [2024-10-11 00:40:53,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53" (1/1) ... [2024-10-11 00:40:53,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53" (1/1) ... [2024-10-11 00:40:53,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53" (1/1) ... [2024-10-11 00:40:53,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53" (1/1) ... [2024-10-11 00:40:53,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53" (1/1) ... [2024-10-11 00:40:53,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53" (1/1) ... [2024-10-11 00:40:53,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:40:53,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:40:53,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:40:53,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:40:53,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53" (1/1) ... [2024-10-11 00:40:53,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:40:53,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:40:53,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:40:53,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:40:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:40:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 00:40:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 00:40:53,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 00:40:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 00:40:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 00:40:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-10-11 00:40:53,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-10-11 00:40:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 00:40:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 00:40:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:40:53,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:40:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 00:40:53,567 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:40:53,568 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:40:53,788 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 00:40:53,788 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:40:53,825 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:40:53,829 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 00:40:53,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:40:53 BoogieIcfgContainer [2024-10-11 00:40:53,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:40:53,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:40:53,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:40:53,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:40:53,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:40:53" (1/3) ... [2024-10-11 00:40:53,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ce7639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:40:53, skipping insertion in model container [2024-10-11 00:40:53,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:40:53" (2/3) ... [2024-10-11 00:40:53,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ce7639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:40:53, skipping insertion in model container [2024-10-11 00:40:53,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:40:53" (3/3) ... [2024-10-11 00:40:53,839 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2024-10-11 00:40:53,852 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:40:53,852 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:40:53,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:40:53,914 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;@2c46172b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:40:53,915 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:40:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:40:53,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 00:40:53,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:53,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:53,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:53,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:53,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1445946450, now seen corresponding path program 1 times [2024-10-11 00:40:53,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:40:53,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906259119] [2024-10-11 00:40:53,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:53,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:40:53,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:40:53,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:40:53,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 00:40:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:54,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 00:40:54,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:40:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:54,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:40:54,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:40:54,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906259119] [2024-10-11 00:40:54,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906259119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:54,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:54,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:40:54,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790870274] [2024-10-11 00:40:54,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:54,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 00:40:54,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:40:54,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 00:40:54,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:40:54,081 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:54,109 INFO L93 Difference]: Finished difference Result 41 states and 61 transitions. [2024-10-11 00:40:54,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 00:40:54,112 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 00:40:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:54,119 INFO L225 Difference]: With dead ends: 41 [2024-10-11 00:40:54,120 INFO L226 Difference]: Without dead ends: 19 [2024-10-11 00:40:54,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:40:54,128 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:54,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:40:54,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-11 00:40:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-11 00:40:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:40:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-10-11 00:40:54,165 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 12 [2024-10-11 00:40:54,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:54,165 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-10-11 00:40:54,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-10-11 00:40:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 00:40:54,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:54,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:54,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 00:40:54,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:40:54,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:54,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:54,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1722829279, now seen corresponding path program 1 times [2024-10-11 00:40:54,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:40:54,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549344337] [2024-10-11 00:40:54,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:54,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:40:54,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:40:54,375 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:40:54,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 00:40:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:54,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:40:54,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:40:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:54,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:40:54,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:40:54,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549344337] [2024-10-11 00:40:54,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549344337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:54,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:54,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:40:54,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602317206] [2024-10-11 00:40:54,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:54,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:40:54,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:40:54,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:40:54,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:40:54,573 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:54,614 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2024-10-11 00:40:54,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:40:54,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-11 00:40:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:54,622 INFO L225 Difference]: With dead ends: 26 [2024-10-11 00:40:54,622 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 00:40:54,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:40:54,623 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:54,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:40:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 00:40:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 00:40:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:40:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-10-11 00:40:54,655 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2024-10-11 00:40:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:54,656 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-10-11 00:40:54,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2024-10-11 00:40:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 00:40:54,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:54,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:54,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 00:40:54,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:40:54,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:54,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2033356043, now seen corresponding path program 1 times [2024-10-11 00:40:54,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:40:54,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243045243] [2024-10-11 00:40:54,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:54,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:40:54,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:40:54,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:40:54,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 00:40:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:55,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:40:55,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:40:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:55,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:40:55,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:40:55,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243045243] [2024-10-11 00:40:55,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243045243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:55,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:55,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:40:55,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129692671] [2024-10-11 00:40:55,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:55,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:40:55,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:40:55,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:40:55,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:40:55,088 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:55,161 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-10-11 00:40:55,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:40:55,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 00:40:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:55,166 INFO L225 Difference]: With dead ends: 29 [2024-10-11 00:40:55,166 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 00:40:55,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:40:55,169 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:55,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 00:40:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 00:40:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-10-11 00:40:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:40:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-10-11 00:40:55,183 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 14 [2024-10-11 00:40:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:55,184 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-10-11 00:40:55,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2024-10-11 00:40:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 00:40:55,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:55,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:55,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 00:40:55,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:40:55,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:55,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:55,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1039030691, now seen corresponding path program 1 times [2024-10-11 00:40:55,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:40:55,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002257558] [2024-10-11 00:40:55,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:55,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:40:55,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:40:55,401 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:40:55,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 00:40:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:55,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:40:55,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:40:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:55,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:40:55,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:40:55,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002257558] [2024-10-11 00:40:55,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002257558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:55,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:55,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:40:55,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281583001] [2024-10-11 00:40:55,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:55,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:40:55,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:40:55,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:40:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:40:55,505 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:55,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:55,534 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-10-11 00:40:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:40:55,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 00:40:55,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:55,536 INFO L225 Difference]: With dead ends: 29 [2024-10-11 00:40:55,536 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 00:40:55,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:40:55,537 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:55,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:40:55,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 00:40:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-10-11 00:40:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:40:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-10-11 00:40:55,544 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 15 [2024-10-11 00:40:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:55,544 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-10-11 00:40:55,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2024-10-11 00:40:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 00:40:55,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:55,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:55,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 00:40:55,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:40:55,752 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:55,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:55,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1048786361, now seen corresponding path program 1 times [2024-10-11 00:40:55,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:40:55,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948839526] [2024-10-11 00:40:55,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:55,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:40:55,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:40:55,756 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:40:55,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 00:40:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:55,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:40:55,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:40:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:55,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:40:55,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:40:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948839526] [2024-10-11 00:40:55,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948839526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:55,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:55,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:40:55,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967196797] [2024-10-11 00:40:55,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:55,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:40:55,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:40:55,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:40:55,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:40:55,894 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:55,946 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-10-11 00:40:55,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:40:55,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 00:40:55,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:40:55,950 INFO L225 Difference]: With dead ends: 29 [2024-10-11 00:40:55,951 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 00:40:55,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:40:55,955 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:40:55,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:40:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 00:40:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-10-11 00:40:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:40:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-10-11 00:40:55,966 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 16 [2024-10-11 00:40:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:40:55,969 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-10-11 00:40:55,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2024-10-11 00:40:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 00:40:55,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:40:55,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:40:55,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 00:40:56,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:40:56,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:40:56,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:40:56,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1936290042, now seen corresponding path program 1 times [2024-10-11 00:40:56,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:40:56,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664626233] [2024-10-11 00:40:56,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:40:56,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:40:56,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:40:56,178 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:40:56,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 00:40:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:40:56,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 00:40:56,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:40:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:40:57,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:40:57,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:40:57,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664626233] [2024-10-11 00:40:57,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664626233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:40:57,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:40:57,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 00:40:57,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420456722] [2024-10-11 00:40:57,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:40:57,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 00:40:57,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:40:57,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 00:40:57,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 00:40:57,124 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:40:59,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 00:40:59,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:40:59,997 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2024-10-11 00:41:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 00:41:00,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 00:41:00,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:00,003 INFO L225 Difference]: With dead ends: 39 [2024-10-11 00:41:00,003 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 00:41:00,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-11 00:41:00,004 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:00,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 45 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 00:41:00,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 00:41:00,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 00:41:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 00:41:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-10-11 00:41:00,008 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 16 [2024-10-11 00:41:00,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:00,009 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-11 00:41:00,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 00:41:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-10-11 00:41:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 00:41:00,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:00,009 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:00,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 00:41:00,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:41:00,211 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:00,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:00,211 INFO L85 PathProgramCache]: Analyzing trace with hash -783419741, now seen corresponding path program 1 times [2024-10-11 00:41:00,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:00,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253611820] [2024-10-11 00:41:00,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:00,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:41:00,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:00,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:41:00,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 00:41:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:00,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 00:41:00,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 00:41:00,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:00,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253611820] [2024-10-11 00:41:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253611820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:00,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:00,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 00:41:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787549371] [2024-10-11 00:41:00,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:00,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 00:41:00,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:00,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 00:41:00,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 00:41:00,487 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:03,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 00:41:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:03,458 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2024-10-11 00:41:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 00:41:03,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-11 00:41:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:03,459 INFO L225 Difference]: With dead ends: 29 [2024-10-11 00:41:03,460 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 00:41:03,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 00:41:03,461 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:03,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 50 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 00:41:03,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 00:41:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-10-11 00:41:03,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:41:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-10-11 00:41:03,471 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 21 [2024-10-11 00:41:03,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:03,471 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-11 00:41:03,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-10-11 00:41:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 00:41:03,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:03,472 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:03,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 00:41:03,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:41:03,678 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:03,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1814741861, now seen corresponding path program 1 times [2024-10-11 00:41:03,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:03,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429441374] [2024-10-11 00:41:03,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:03,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:41:03,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:03,686 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:41:03,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 00:41:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:03,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 00:41:03,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 00:41:03,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:03,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:03,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429441374] [2024-10-11 00:41:03,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429441374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:03,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:03,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 00:41:03,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691859521] [2024-10-11 00:41:03,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:03,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 00:41:03,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:03,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 00:41:03,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 00:41:03,932 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:04,233 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-10-11 00:41:04,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 00:41:04,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-11 00:41:04,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:04,234 INFO L225 Difference]: With dead ends: 31 [2024-10-11 00:41:04,235 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 00:41:04,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 00:41:04,236 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:04,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 54 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 00:41:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 00:41:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-10-11 00:41:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:41:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-10-11 00:41:04,241 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 22 [2024-10-11 00:41:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:04,241 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-11 00:41:04,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-10-11 00:41:04,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 00:41:04,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:04,242 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:04,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 00:41:04,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:41:04,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:04,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:04,448 INFO L85 PathProgramCache]: Analyzing trace with hash 8420327, now seen corresponding path program 1 times [2024-10-11 00:41:04,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:04,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103273317] [2024-10-11 00:41:04,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:04,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:41:04,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:04,449 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:41:04,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 00:41:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:04,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 00:41:04,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 00:41:04,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:04,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:04,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103273317] [2024-10-11 00:41:04,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103273317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:04,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:04,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 00:41:04,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58468177] [2024-10-11 00:41:04,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:04,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 00:41:04,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:04,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 00:41:04,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 00:41:04,665 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:05,766 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-10-11 00:41:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 00:41:05,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-11 00:41:05,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:05,767 INFO L225 Difference]: With dead ends: 33 [2024-10-11 00:41:05,767 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 00:41:05,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 00:41:05,768 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:05,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 50 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 00:41:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 00:41:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2024-10-11 00:41:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 00:41:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-10-11 00:41:05,773 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 23 [2024-10-11 00:41:05,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:05,773 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-11 00:41:05,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:05,774 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-10-11 00:41:05,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 00:41:05,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:05,774 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:05,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 00:41:05,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:41:05,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:05,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:05,976 INFO L85 PathProgramCache]: Analyzing trace with hash -897924951, now seen corresponding path program 1 times [2024-10-11 00:41:05,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:05,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273288782] [2024-10-11 00:41:05,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:05,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:41:05,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:05,981 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:41:05,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 00:41:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:06,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 00:41:06,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 00:41:06,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:06,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:06,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273288782] [2024-10-11 00:41:06,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273288782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:06,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:06,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 00:41:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123367766] [2024-10-11 00:41:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:06,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 00:41:06,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:06,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 00:41:06,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 00:41:06,241 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:07,354 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-10-11 00:41:07,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 00:41:07,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-11 00:41:07,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:07,356 INFO L225 Difference]: With dead ends: 29 [2024-10-11 00:41:07,356 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 00:41:07,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 00:41:07,357 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:07,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 54 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 00:41:07,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 00:41:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-10-11 00:41:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:41:07,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-11 00:41:07,362 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 24 [2024-10-11 00:41:07,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:07,363 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-11 00:41:07,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:07,363 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-11 00:41:07,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 00:41:07,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:07,364 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:07,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 00:41:07,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:41:07,565 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:07,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:07,566 INFO L85 PathProgramCache]: Analyzing trace with hash -10421270, now seen corresponding path program 1 times [2024-10-11 00:41:07,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:07,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743416984] [2024-10-11 00:41:07,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:07,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:41:07,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:07,568 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:41:07,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 00:41:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:07,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:41:07,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 00:41:07,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:07,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:07,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743416984] [2024-10-11 00:41:07,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743416984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:07,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:41:07,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:41:07,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013154405] [2024-10-11 00:41:07,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:07,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:41:07,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:07,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:41:07,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:07,681 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:07,799 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-10-11 00:41:07,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:41:07,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-11 00:41:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:07,800 INFO L225 Difference]: With dead ends: 25 [2024-10-11 00:41:07,800 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 00:41:07,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:41:07,801 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:07,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 00:41:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 00:41:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 00:41:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 00:41:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-10-11 00:41:07,809 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 24 [2024-10-11 00:41:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:07,809 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-11 00:41:07,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-10-11 00:41:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 00:41:07,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:41:07,812 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:07,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 00:41:08,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:41:08,013 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:41:08,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:41:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash -10480852, now seen corresponding path program 1 times [2024-10-11 00:41:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:41:08,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947182519] [2024-10-11 00:41:08,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:08,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:41:08,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:41:08,018 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 00:41:08,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 00:41:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:08,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 00:41:08,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 00:41:08,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 00:41:09,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:41:09,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947182519] [2024-10-11 00:41:09,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947182519] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:41:09,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1507787951] [2024-10-11 00:41:09,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:41:09,516 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 00:41:09,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 00:41:09,519 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 00:41:09,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-10-11 00:41:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:41:09,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 00:41:09,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:41:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 00:41:09,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:41:09,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1507787951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:41:09,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 00:41:09,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-11 00:41:09,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459466585] [2024-10-11 00:41:09,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:41:09,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 00:41:09,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:41:09,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 00:41:09,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-11 00:41:09,975 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:10,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:41:10,012 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-10-11 00:41:10,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 00:41:10,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-11 00:41:10,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:41:10,014 INFO L225 Difference]: With dead ends: 21 [2024-10-11 00:41:10,014 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 00:41:10,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-11 00:41:10,015 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:41:10,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:41:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 00:41:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 00:41:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:41:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 00:41:10,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2024-10-11 00:41:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:41:10,017 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 00:41:10,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 00:41:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 00:41:10,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 00:41:10,020 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 00:41:10,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-10-11 00:41:10,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-11 00:41:10,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 00:41:10,426 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:41:10,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 00:41:11,358 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 00:41:11,392 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 00:41:11,393 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 00:41:11,393 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 00:41:11,393 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 00:41:11,394 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 00:41:11,394 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 00:41:11,394 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 00:41:11,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:41:11 BoogieIcfgContainer [2024-10-11 00:41:11,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 00:41:11,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 00:41:11,396 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 00:41:11,396 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 00:41:11,397 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:40:53" (3/4) ... [2024-10-11 00:41:11,399 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 00:41:11,402 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2024-10-11 00:41:11,406 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 00:41:11,406 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-11 00:41:11,406 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 00:41:11,406 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 00:41:11,433 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2024-10-11 00:41:11,445 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2024-10-11 00:41:11,507 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 00:41:11,508 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 00:41:11,508 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 00:41:11,508 INFO L158 Benchmark]: Toolchain (without parser) took 18368.14ms. Allocated memory was 81.8MB in the beginning and 113.2MB in the end (delta: 31.5MB). Free memory was 62.2MB in the beginning and 57.2MB in the end (delta: 5.0MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-10-11 00:41:11,509 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 58.7MB. Free memory was 40.4MB in the beginning and 40.3MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:41:11,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.91ms. Allocated memory is still 81.8MB. Free memory was 61.9MB in the beginning and 48.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 00:41:11,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.61ms. Allocated memory is still 81.8MB. Free memory was 48.3MB in the beginning and 46.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:41:11,509 INFO L158 Benchmark]: Boogie Preprocessor took 33.23ms. Allocated memory is still 81.8MB. Free memory was 46.8MB in the beginning and 44.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 00:41:11,509 INFO L158 Benchmark]: RCFGBuilder took 430.64ms. Allocated memory is still 81.8MB. Free memory was 44.4MB in the beginning and 58.5MB in the end (delta: -14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 00:41:11,509 INFO L158 Benchmark]: TraceAbstraction took 17563.91ms. Allocated memory was 81.8MB in the beginning and 113.2MB in the end (delta: 31.5MB). Free memory was 58.1MB in the beginning and 62.5MB in the end (delta: -4.3MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-10-11 00:41:11,510 INFO L158 Benchmark]: Witness Printer took 111.82ms. Allocated memory is still 113.2MB. Free memory was 62.5MB in the beginning and 57.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 00:41:11,514 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 58.7MB. Free memory was 40.4MB in the beginning and 40.3MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.91ms. Allocated memory is still 81.8MB. Free memory was 61.9MB in the beginning and 48.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.61ms. Allocated memory is still 81.8MB. Free memory was 48.3MB in the beginning and 46.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.23ms. Allocated memory is still 81.8MB. Free memory was 46.8MB in the beginning and 44.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 430.64ms. Allocated memory is still 81.8MB. Free memory was 44.4MB in the beginning and 58.5MB in the end (delta: -14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17563.91ms. Allocated memory was 81.8MB in the beginning and 113.2MB in the end (delta: 31.5MB). Free memory was 58.1MB in the beginning and 62.5MB in the end (delta: -4.3MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * Witness Printer took 111.82ms. Allocated memory is still 113.2MB. Free memory was 62.5MB in the beginning and 57.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 70]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 684 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 458 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 496 IncrementalHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 226 mSDtfsCounter, 496 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=7, InterpolantAutomatonStates: 65, 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, 12 MinimizatonAttempts, 21 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 235 ConstructedInterpolants, 54 QuantifiedInterpolants, 1612 SizeOfPredicates, 22 NumberOfNonLiveVariables, 910 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 37/42 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (\old(x) == x) - ProcedureContractResult [Line: 19]: Procedure Contract for __fpclassify_double Derived contract for procedure __fpclassify_double. Ensures: ((((0 == \result) || ((((4 == \result) || (2 == \result)) || (3 == \result)) || (1 == \result))) || ((((4 == \result) || (2 == \result)) || (3 == \result)) || (1 == \result))) || ((((4 == \result) || (2 == \result)) || (3 == \result)) || (1 == \result))) RESULT: Ultimate proved your program to be correct! [2024-10-11 00:41:11,730 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-11 00:41:11,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE