./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20590a3b952f77870c005ea22da4ee2c3e5fa42d319fcea291376108e5b76f76 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 21:58:37,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 21:58:37,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 21:58:37,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 21:58:37,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 21:58:37,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 21:58:37,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 21:58:37,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 21:58:37,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 21:58:37,823 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 21:58:37,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 21:58:37,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 21:58:37,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 21:58:37,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 21:58:37,826 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 21:58:37,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 21:58:37,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 21:58:37,827 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 21:58:37,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 21:58:37,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 21:58:37,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 21:58:37,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 21:58:37,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 21:58:37,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 21:58:37,832 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 21:58:37,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 21:58:37,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 21:58:37,832 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 21:58:37,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 21:58:37,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 21:58:37,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 21:58:37,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 21:58:37,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:58:37,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 21:58:37,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 21:58:37,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 21:58:37,835 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 21:58:37,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 21:58:37,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 21:58:37,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 21:58:37,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 21:58:37,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 21:58:37,837 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20590a3b952f77870c005ea22da4ee2c3e5fa42d319fcea291376108e5b76f76 [2024-11-18 21:58:38,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 21:58:38,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 21:58:38,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 21:58:38,153 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 21:58:38,154 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 21:58:38,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i [2024-11-18 21:58:39,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 21:58:39,821 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 21:58:39,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i [2024-11-18 21:58:39,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bcda3ca/c6833b0c0a17428eb3103a92ba86f9c8/FLAGab268315e [2024-11-18 21:58:39,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bcda3ca/c6833b0c0a17428eb3103a92ba86f9c8 [2024-11-18 21:58:39,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 21:58:39,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 21:58:39,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 21:58:39,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 21:58:39,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 21:58:39,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:58:39" (1/1) ... [2024-11-18 21:58:39,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c545695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:39, skipping insertion in model container [2024-11-18 21:58:39,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:58:39" (1/1) ... [2024-11-18 21:58:39,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 21:58:40,068 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i[917,930] [2024-11-18 21:58:40,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:58:40,142 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 21:58:40,157 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i[917,930] [2024-11-18 21:58:40,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:58:40,198 INFO L204 MainTranslator]: Completed translation [2024-11-18 21:58:40,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:40 WrapperNode [2024-11-18 21:58:40,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 21:58:40,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 21:58:40,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 21:58:40,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 21:58:40,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:40" (1/1) ... [2024-11-18 21:58:40,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:40" (1/1) ... [2024-11-18 21:58:40,255 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-11-18 21:58:40,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 21:58:40,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 21:58:40,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 21:58:40,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 21:58:40,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:40" (1/1) ... [2024-11-18 21:58:40,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:40" (1/1) ... [2024-11-18 21:58:40,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:40" (1/1) ... [2024-11-18 21:58:40,290 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 21:58:40,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:40" (1/1) ... [2024-11-18 21:58:40,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:40" (1/1) ... [2024-11-18 21:58:40,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:40" (1/1) ... [2024-11-18 21:58:40,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:40" (1/1) ... [2024-11-18 21:58:40,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:40" (1/1) ... [2024-11-18 21:58:40,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:40" (1/1) ... [2024-11-18 21:58:40,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 21:58:40,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 21:58:40,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 21:58:40,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 21:58:40,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:40" (1/1) ... [2024-11-18 21:58:40,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:58:40,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:58:40,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 21:58:40,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 21:58:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 21:58:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 21:58:40,418 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 21:58:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 21:58:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 21:58:40,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 21:58:40,514 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 21:58:40,516 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 21:58:40,850 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-18 21:58:40,850 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 21:58:40,883 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 21:58:40,883 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 21:58:40,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:58:40 BoogieIcfgContainer [2024-11-18 21:58:40,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 21:58:40,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 21:58:40,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 21:58:40,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 21:58:40,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:58:39" (1/3) ... [2024-11-18 21:58:40,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e97141c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:58:40, skipping insertion in model container [2024-11-18 21:58:40,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:58:40" (2/3) ... [2024-11-18 21:58:40,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e97141c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:58:40, skipping insertion in model container [2024-11-18 21:58:40,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:58:40" (3/3) ... [2024-11-18 21:58:40,893 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-18.i [2024-11-18 21:58:40,935 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 21:58:40,936 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 21:58:40,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 21:58:41,003 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;@31249b7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 21:58:41,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 21:58:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 50 states have internal predecessors, (71), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 21:58:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-18 21:58:41,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:58:41,022 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:58:41,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:58:41,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:58:41,029 INFO L85 PathProgramCache]: Analyzing trace with hash -514369375, now seen corresponding path program 1 times [2024-11-18 21:58:41,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:58:41,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745265060] [2024-11-18 21:58:41,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:58:41,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:58:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:58:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-18 21:58:41,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:58:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745265060] [2024-11-18 21:58:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745265060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 21:58:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209699675] [2024-11-18 21:58:41,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:58:41,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:58:41,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:58:41,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 21:58:41,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 21:58:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:58:41,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 21:58:41,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:58:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-18 21:58:41,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:58:41,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209699675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:58:41,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 21:58:41,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 21:58:41,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163635022] [2024-11-18 21:58:41,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:58:41,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 21:58:41,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:58:41,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 21:58:41,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 21:58:41,563 INFO L87 Difference]: Start difference. First operand has 64 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 50 states have internal predecessors, (71), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-18 21:58:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:58:41,587 INFO L93 Difference]: Finished difference Result 121 states and 196 transitions. [2024-11-18 21:58:41,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 21:58:41,590 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2024-11-18 21:58:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:58:41,595 INFO L225 Difference]: With dead ends: 121 [2024-11-18 21:58:41,596 INFO L226 Difference]: Without dead ends: 60 [2024-11-18 21:58:41,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 21:58:41,601 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 21:58:41,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 21:58:41,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-18 21:58:41,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-18 21:58:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 21:58:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2024-11-18 21:58:41,640 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 87 [2024-11-18 21:58:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:58:41,641 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2024-11-18 21:58:41,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-18 21:58:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2024-11-18 21:58:41,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-18 21:58:41,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:58:41,644 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:58:41,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 21:58:41,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 21:58:41,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:58:41,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:58:41,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1209871581, now seen corresponding path program 1 times [2024-11-18 21:58:41,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:58:41,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594552311] [2024-11-18 21:58:41,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:58:41,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:58:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:58:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-18 21:58:42,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:58:42,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594552311] [2024-11-18 21:58:42,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594552311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:58:42,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:58:42,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 21:58:42,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183134711] [2024-11-18 21:58:42,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:58:42,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:58:42,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:58:42,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:58:42,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:58:42,275 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:58:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:58:42,447 INFO L93 Difference]: Finished difference Result 174 states and 258 transitions. [2024-11-18 21:58:42,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:58:42,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-11-18 21:58:42,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:58:42,450 INFO L225 Difference]: With dead ends: 174 [2024-11-18 21:58:42,450 INFO L226 Difference]: Without dead ends: 117 [2024-11-18 21:58:42,452 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-11-18 21:58:42,453 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 54 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:58:42,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 133 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 21:58:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-18 21:58:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2024-11-18 21:58:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-18 21:58:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2024-11-18 21:58:42,480 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 166 transitions. Word has length 87 [2024-11-18 21:58:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:58:42,480 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 166 transitions. [2024-11-18 21:58:42,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:58:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 166 transitions. [2024-11-18 21:58:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-18 21:58:42,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:58:42,483 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:58:42,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 21:58:42,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:58:42,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:58:42,484 INFO L85 PathProgramCache]: Analyzing trace with hash 466056458, now seen corresponding path program 1 times [2024-11-18 21:58:42,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:58:42,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090925390] [2024-11-18 21:58:42,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:58:42,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:58:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:58:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-18 21:58:43,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:58:43,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090925390] [2024-11-18 21:58:43,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090925390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 21:58:43,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617965581] [2024-11-18 21:58:43,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:58:43,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:58:43,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:58:43,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 21:58:43,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 21:58:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:58:43,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-18 21:58:43,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:58:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-18 21:58:43,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 21:58:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-18 21:58:44,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617965581] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 21:58:44,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 21:58:44,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2024-11-18 21:58:44,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48516741] [2024-11-18 21:58:44,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 21:58:44,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-18 21:58:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:58:44,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-18 21:58:44,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2024-11-18 21:58:44,202 INFO L87 Difference]: Start difference. First operand 114 states and 166 transitions. Second operand has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-18 21:58:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:58:45,246 INFO L93 Difference]: Finished difference Result 366 states and 521 transitions. [2024-11-18 21:58:45,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 21:58:45,247 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) Word has length 88 [2024-11-18 21:58:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:58:45,250 INFO L225 Difference]: With dead ends: 366 [2024-11-18 21:58:45,250 INFO L226 Difference]: Without dead ends: 255 [2024-11-18 21:58:45,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2024-11-18 21:58:45,254 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 189 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 21:58:45,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 398 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 21:58:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-18 21:58:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 245. [2024-11-18 21:58:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 188 states have (on average 1.2234042553191489) internal successors, (230), 188 states have internal predecessors, (230), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-18 21:58:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 326 transitions. [2024-11-18 21:58:45,291 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 326 transitions. Word has length 88 [2024-11-18 21:58:45,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:58:45,291 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 326 transitions. [2024-11-18 21:58:45,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-18 21:58:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 326 transitions. [2024-11-18 21:58:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-18 21:58:45,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:58:45,293 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:58:45,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 21:58:45,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-18 21:58:45,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:58:45,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:58:45,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1703942898, now seen corresponding path program 1 times [2024-11-18 21:58:45,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:58:45,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646584183] [2024-11-18 21:58:45,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:58:45,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:58:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:58:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-18 21:58:49,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:58:49,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646584183] [2024-11-18 21:58:49,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646584183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:58:49,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:58:49,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-18 21:58:49,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548855734] [2024-11-18 21:58:49,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:58:49,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 21:58:49,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:58:49,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 21:58:49,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-18 21:58:49,106 INFO L87 Difference]: Start difference. First operand 245 states and 326 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:58:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:58:51,021 INFO L93 Difference]: Finished difference Result 648 states and 845 transitions. [2024-11-18 21:58:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 21:58:51,022 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-11-18 21:58:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:58:51,027 INFO L225 Difference]: With dead ends: 648 [2024-11-18 21:58:51,030 INFO L226 Difference]: Without dead ends: 406 [2024-11-18 21:58:51,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2024-11-18 21:58:51,033 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 524 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:58:51,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 472 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 21:58:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-18 21:58:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 257. [2024-11-18 21:58:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 200 states have (on average 1.215) internal successors, (243), 200 states have internal predecessors, (243), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-18 21:58:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 339 transitions. [2024-11-18 21:58:51,078 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 339 transitions. Word has length 89 [2024-11-18 21:58:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:58:51,079 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 339 transitions. [2024-11-18 21:58:51,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:58:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 339 transitions. [2024-11-18 21:58:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-18 21:58:51,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:58:51,081 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:58:51,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 21:58:51,081 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:58:51,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:58:51,082 INFO L85 PathProgramCache]: Analyzing trace with hash 682874544, now seen corresponding path program 1 times [2024-11-18 21:58:51,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:58:51,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973046474] [2024-11-18 21:58:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:58:51,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:58:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:58:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-18 21:58:53,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:58:53,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973046474] [2024-11-18 21:58:53,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973046474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:58:53,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:58:53,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-18 21:58:53,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673610623] [2024-11-18 21:58:53,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:58:53,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 21:58:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:58:53,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 21:58:53,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-18 21:58:53,899 INFO L87 Difference]: Start difference. First operand 257 states and 339 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:58:58,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 21:59:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:59:01,197 INFO L93 Difference]: Finished difference Result 474 states and 604 transitions. [2024-11-18 21:59:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 21:59:01,198 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-11-18 21:59:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:59:01,203 INFO L225 Difference]: With dead ends: 474 [2024-11-18 21:59:01,204 INFO L226 Difference]: Without dead ends: 411 [2024-11-18 21:59:01,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-18 21:59:01,206 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 258 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-18 21:59:01,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 636 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1193 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2024-11-18 21:59:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-18 21:59:01,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 257. [2024-11-18 21:59:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 200 states have (on average 1.215) internal successors, (243), 200 states have internal predecessors, (243), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-18 21:59:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 339 transitions. [2024-11-18 21:59:01,239 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 339 transitions. Word has length 89 [2024-11-18 21:59:01,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:59:01,241 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 339 transitions. [2024-11-18 21:59:01,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:59:01,241 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 339 transitions. [2024-11-18 21:59:01,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-18 21:59:01,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:59:01,243 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:59:01,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 21:59:01,243 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:59:01,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:59:01,244 INFO L85 PathProgramCache]: Analyzing trace with hash -68655379, now seen corresponding path program 1 times [2024-11-18 21:59:01,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:59:01,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130162492] [2024-11-18 21:59:01,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:59:01,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:59:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:59:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-18 21:59:01,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:59:01,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130162492] [2024-11-18 21:59:01,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130162492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:59:01,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:59:01,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 21:59:01,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892812553] [2024-11-18 21:59:01,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:59:01,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:59:01,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:59:01,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:59:01,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:59:01,350 INFO L87 Difference]: Start difference. First operand 257 states and 339 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:59:01,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:59:01,380 INFO L93 Difference]: Finished difference Result 516 states and 685 transitions. [2024-11-18 21:59:01,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:59:01,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2024-11-18 21:59:01,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:59:01,383 INFO L225 Difference]: With dead ends: 516 [2024-11-18 21:59:01,384 INFO L226 Difference]: Without dead ends: 262 [2024-11-18 21:59:01,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-18 21:59:01,385 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 21:59:01,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 21:59:01,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-18 21:59:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2024-11-18 21:59:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 203 states have (on average 1.2118226600985222) internal successors, (246), 203 states have internal predecessors, (246), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-18 21:59:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 342 transitions. [2024-11-18 21:59:01,416 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 342 transitions. Word has length 90 [2024-11-18 21:59:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:59:01,417 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 342 transitions. [2024-11-18 21:59:01,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:59:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 342 transitions. [2024-11-18 21:59:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-18 21:59:01,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:59:01,419 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:59:01,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 21:59:01,419 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:59:01,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:59:01,421 INFO L85 PathProgramCache]: Analyzing trace with hash 272433549, now seen corresponding path program 1 times [2024-11-18 21:59:01,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:59:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145913138] [2024-11-18 21:59:01,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:59:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:59:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:59:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-18 21:59:01,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:59:01,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145913138] [2024-11-18 21:59:01,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145913138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:59:01,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:59:01,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 21:59:01,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104830784] [2024-11-18 21:59:01,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:59:01,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 21:59:01,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:59:01,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 21:59:01,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 21:59:01,913 INFO L87 Difference]: Start difference. First operand 260 states and 342 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:59:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:59:02,102 INFO L93 Difference]: Finished difference Result 322 states and 414 transitions. [2024-11-18 21:59:02,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 21:59:02,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2024-11-18 21:59:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:59:02,105 INFO L225 Difference]: With dead ends: 322 [2024-11-18 21:59:02,106 INFO L226 Difference]: Without dead ends: 320 [2024-11-18 21:59:02,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-18 21:59:02,108 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 24 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:59:02,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 303 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 21:59:02,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-18 21:59:02,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 306. [2024-11-18 21:59:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 249 states have (on average 1.2048192771084338) internal successors, (300), 249 states have internal predecessors, (300), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-18 21:59:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 396 transitions. [2024-11-18 21:59:02,133 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 396 transitions. Word has length 91 [2024-11-18 21:59:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:59:02,134 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 396 transitions. [2024-11-18 21:59:02,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:59:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 396 transitions. [2024-11-18 21:59:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-18 21:59:02,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:59:02,137 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:59:02,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 21:59:02,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:59:02,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:59:02,138 INFO L85 PathProgramCache]: Analyzing trace with hash 59794543, now seen corresponding path program 1 times [2024-11-18 21:59:02,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:59:02,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753981639] [2024-11-18 21:59:02,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:59:02,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:59:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:59:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-18 21:59:02,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:59:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753981639] [2024-11-18 21:59:02,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753981639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:59:02,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:59:02,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 21:59:02,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287685271] [2024-11-18 21:59:02,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:59:02,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:59:02,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:59:02,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:59:02,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:59:02,185 INFO L87 Difference]: Start difference. First operand 306 states and 396 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:59:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:59:02,274 INFO L93 Difference]: Finished difference Result 519 states and 678 transitions. [2024-11-18 21:59:02,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:59:02,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2024-11-18 21:59:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:59:02,277 INFO L225 Difference]: With dead ends: 519 [2024-11-18 21:59:02,277 INFO L226 Difference]: Without dead ends: 355 [2024-11-18 21:59:02,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-18 21:59:02,279 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 67 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:59:02,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 117 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 21:59:02,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-18 21:59:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 207. [2024-11-18 21:59:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 164 states have (on average 1.1890243902439024) internal successors, (195), 164 states have internal predecessors, (195), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-18 21:59:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 267 transitions. [2024-11-18 21:59:02,309 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 267 transitions. Word has length 91 [2024-11-18 21:59:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:59:02,310 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 267 transitions. [2024-11-18 21:59:02,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:59:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 267 transitions. [2024-11-18 21:59:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-18 21:59:02,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:59:02,313 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:59:02,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 21:59:02,313 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:59:02,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:59:02,313 INFO L85 PathProgramCache]: Analyzing trace with hash 200214122, now seen corresponding path program 1 times [2024-11-18 21:59:02,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:59:02,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474598743] [2024-11-18 21:59:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:59:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:59:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:59:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-18 21:59:02,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:59:02,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474598743] [2024-11-18 21:59:02,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474598743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:59:02,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:59:02,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 21:59:02,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680839297] [2024-11-18 21:59:02,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:59:02,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:59:02,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:59:02,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:59:02,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:59:02,363 INFO L87 Difference]: Start difference. First operand 207 states and 267 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:59:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:59:02,452 INFO L93 Difference]: Finished difference Result 348 states and 448 transitions. [2024-11-18 21:59:02,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:59:02,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2024-11-18 21:59:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:59:02,454 INFO L225 Difference]: With dead ends: 348 [2024-11-18 21:59:02,454 INFO L226 Difference]: Without dead ends: 214 [2024-11-18 21:59:02,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-18 21:59:02,457 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:59:02,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 168 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 21:59:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-18 21:59:02,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2024-11-18 21:59:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 168 states have (on average 1.1666666666666667) internal successors, (196), 168 states have internal predecessors, (196), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-18 21:59:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 268 transitions. [2024-11-18 21:59:02,477 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 268 transitions. Word has length 92 [2024-11-18 21:59:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:59:02,478 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 268 transitions. [2024-11-18 21:59:02,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:59:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 268 transitions. [2024-11-18 21:59:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-18 21:59:02,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:59:02,479 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:59:02,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 21:59:02,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:59:02,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:59:02,480 INFO L85 PathProgramCache]: Analyzing trace with hash -703972000, now seen corresponding path program 1 times [2024-11-18 21:59:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:59:02,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394640366] [2024-11-18 21:59:02,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:59:02,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:59:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:59:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-18 21:59:03,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:59:03,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394640366] [2024-11-18 21:59:03,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394640366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:59:03,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:59:03,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 21:59:03,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102134392] [2024-11-18 21:59:03,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:59:03,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 21:59:03,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:59:03,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 21:59:03,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 21:59:03,010 INFO L87 Difference]: Start difference. First operand 211 states and 268 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:59:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:59:03,287 INFO L93 Difference]: Finished difference Result 376 states and 470 transitions. [2024-11-18 21:59:03,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 21:59:03,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 93 [2024-11-18 21:59:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:59:03,292 INFO L225 Difference]: With dead ends: 376 [2024-11-18 21:59:03,292 INFO L226 Difference]: Without dead ends: 233 [2024-11-18 21:59:03,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-18 21:59:03,293 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 86 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 21:59:03,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 298 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 21:59:03,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-18 21:59:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 207. [2024-11-18 21:59:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 164 states have (on average 1.146341463414634) internal successors, (188), 164 states have internal predecessors, (188), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-18 21:59:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 260 transitions. [2024-11-18 21:59:03,316 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 260 transitions. Word has length 93 [2024-11-18 21:59:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:59:03,317 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 260 transitions. [2024-11-18 21:59:03,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-18 21:59:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 260 transitions. [2024-11-18 21:59:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-18 21:59:03,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:59:03,319 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:59:03,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 21:59:03,319 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:59:03,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:59:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1404582365, now seen corresponding path program 1 times [2024-11-18 21:59:03,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:59:03,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208722593] [2024-11-18 21:59:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:59:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:59:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 21:59:03,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [256634880] [2024-11-18 21:59:03,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:59:03,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:59:03,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:59:03,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 21:59:03,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 21:59:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 21:59:03,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 21:59:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 21:59:03,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 21:59:03,548 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 21:59:03,549 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 21:59:03,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 21:59:03,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:59:03,756 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:59:03,830 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 21:59:03,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:59:03 BoogieIcfgContainer [2024-11-18 21:59:03,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 21:59:03,836 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 21:59:03,836 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 21:59:03,836 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 21:59:03,837 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:58:40" (3/4) ... [2024-11-18 21:59:03,839 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 21:59:03,840 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 21:59:03,841 INFO L158 Benchmark]: Toolchain (without parser) took 23987.91ms. Allocated memory was 153.1MB in the beginning and 411.0MB in the end (delta: 257.9MB). Free memory was 124.1MB in the beginning and 298.5MB in the end (delta: -174.3MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. [2024-11-18 21:59:03,841 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 21:59:03,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.37ms. Allocated memory is still 153.1MB. Free memory was 124.1MB in the beginning and 110.6MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 21:59:03,842 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.51ms. Allocated memory is still 153.1MB. Free memory was 109.6MB in the beginning and 106.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 21:59:03,842 INFO L158 Benchmark]: Boogie Preprocessor took 61.57ms. Allocated memory is still 153.1MB. Free memory was 106.4MB in the beginning and 103.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 21:59:03,842 INFO L158 Benchmark]: RCFGBuilder took 566.41ms. Allocated memory is still 153.1MB. Free memory was 103.3MB in the beginning and 123.0MB in the end (delta: -19.7MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-11-18 21:59:03,843 INFO L158 Benchmark]: TraceAbstraction took 22948.50ms. Allocated memory was 153.1MB in the beginning and 411.0MB in the end (delta: 257.9MB). Free memory was 122.1MB in the beginning and 298.5MB in the end (delta: -176.3MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2024-11-18 21:59:03,843 INFO L158 Benchmark]: Witness Printer took 4.44ms. Allocated memory is still 411.0MB. Free memory is still 298.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 21:59:03,844 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.37ms. Allocated memory is still 153.1MB. Free memory was 124.1MB in the beginning and 110.6MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.51ms. Allocated memory is still 153.1MB. Free memory was 109.6MB in the beginning and 106.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.57ms. Allocated memory is still 153.1MB. Free memory was 106.4MB in the beginning and 103.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 566.41ms. Allocated memory is still 153.1MB. Free memory was 103.3MB in the beginning and 123.0MB in the end (delta: -19.7MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * TraceAbstraction took 22948.50ms. Allocated memory was 153.1MB in the beginning and 411.0MB in the end (delta: 257.9MB). Free memory was 122.1MB in the beginning and 298.5MB in the end (delta: -176.3MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * Witness Printer took 4.44ms. Allocated memory is still 411.0MB. Free memory is still 298.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of bitwiseOr at line 89, overapproximation of bitwiseAnd at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99.25; [L23] signed short int var_1_7 = 18477; [L24] signed short int var_1_8 = 5; [L25] float var_1_9 = 5.8; [L26] float var_1_10 = 0.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 256; [L31] unsigned char var_1_15 = 0; [L32] unsigned char last_1_var_1_11 = 16; [L33] unsigned long int last_1_var_1_14 = 256; VAL [isInitial=0, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=18477, var_1_8=5, var_1_9=29/5] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L85] last_1_var_1_11 = var_1_11 [L86] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=18477, var_1_8=5, var_1_9=29/5] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L64] var_1_7 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L65] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L66] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L66] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L67] var_1_8 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L69] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L69] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L70] var_1_9 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L71] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L72] var_1_10 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L73] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L74] var_1_12 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L75] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L76] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L76] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L77] var_1_13 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L78] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L79] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L79] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L80] var_1_15 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L81] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L82] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L82] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L97] RET updateVariables() [L98] CALL step() [L37] signed short int stepLocal_3 = var_1_8; [L38] unsigned long int stepLocal_2 = last_1_var_1_14; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, stepLocal_3=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L39] COND FALSE !(last_1_var_1_14 > stepLocal_3) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L46] EXPR var_1_11 & var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L46] COND FALSE !((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) [L51] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L53] unsigned char stepLocal_1 = var_1_11; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L54] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L54] unsigned long int stepLocal_0 = var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))); [L55] COND FALSE !(stepLocal_0 != var_1_11) [L60] var_1_1 = 10.5f VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] [L89] EXPR ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((float) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] [L89-L90] return ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((float) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.8s, OverallIterations: 11, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1255 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1255 mSDsluCounter, 2768 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1908 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3126 IncrementalHoareTripleChecker+Invalid, 3303 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 860 mSDtfsCounter, 3126 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=7, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 509 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 1262 NumberOfCodeBlocks, 1262 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1147 ConstructedInterpolants, 0 QuantifiedInterpolants, 5546 SizeOfPredicates, 4 NumberOfNonLiveVariables, 431 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 3311/3432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 21:59:03,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20590a3b952f77870c005ea22da4ee2c3e5fa42d319fcea291376108e5b76f76 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 21:59:06,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 21:59:06,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 21:59:06,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 21:59:06,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 21:59:06,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 21:59:06,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 21:59:06,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 21:59:06,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 21:59:06,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 21:59:06,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 21:59:06,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 21:59:06,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 21:59:06,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 21:59:06,252 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 21:59:06,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 21:59:06,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 21:59:06,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 21:59:06,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 21:59:06,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 21:59:06,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 21:59:06,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 21:59:06,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 21:59:06,259 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 21:59:06,259 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 21:59:06,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 21:59:06,260 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 21:59:06,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 21:59:06,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 21:59:06,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 21:59:06,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 21:59:06,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 21:59:06,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 21:59:06,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 21:59:06,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:59:06,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 21:59:06,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 21:59:06,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 21:59:06,264 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 21:59:06,264 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 21:59:06,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 21:59:06,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 21:59:06,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 21:59:06,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 21:59:06,266 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20590a3b952f77870c005ea22da4ee2c3e5fa42d319fcea291376108e5b76f76 [2024-11-18 21:59:06,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 21:59:06,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 21:59:06,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 21:59:06,637 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 21:59:06,637 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 21:59:06,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i [2024-11-18 21:59:08,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 21:59:08,538 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 21:59:08,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i [2024-11-18 21:59:08,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b253f7bd/7130a32d898f41ceac2ae7edb510b723/FLAGa3990fcb1 [2024-11-18 21:59:08,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b253f7bd/7130a32d898f41ceac2ae7edb510b723 [2024-11-18 21:59:08,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 21:59:08,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 21:59:08,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 21:59:08,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 21:59:08,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 21:59:08,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:59:08" (1/1) ... [2024-11-18 21:59:08,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6fa202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08, skipping insertion in model container [2024-11-18 21:59:08,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:59:08" (1/1) ... [2024-11-18 21:59:08,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 21:59:08,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i[917,930] [2024-11-18 21:59:08,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:59:08,869 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 21:59:08,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i[917,930] [2024-11-18 21:59:08,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:59:08,937 INFO L204 MainTranslator]: Completed translation [2024-11-18 21:59:08,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08 WrapperNode [2024-11-18 21:59:08,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 21:59:08,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 21:59:08,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 21:59:08,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 21:59:08,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08" (1/1) ... [2024-11-18 21:59:08,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08" (1/1) ... [2024-11-18 21:59:08,994 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2024-11-18 21:59:08,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 21:59:08,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 21:59:08,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 21:59:08,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 21:59:09,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08" (1/1) ... [2024-11-18 21:59:09,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08" (1/1) ... [2024-11-18 21:59:09,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08" (1/1) ... [2024-11-18 21:59:09,034 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 21:59:09,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08" (1/1) ... [2024-11-18 21:59:09,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08" (1/1) ... [2024-11-18 21:59:09,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08" (1/1) ... [2024-11-18 21:59:09,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08" (1/1) ... [2024-11-18 21:59:09,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08" (1/1) ... [2024-11-18 21:59:09,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08" (1/1) ... [2024-11-18 21:59:09,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 21:59:09,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 21:59:09,068 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 21:59:09,068 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 21:59:09,069 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08" (1/1) ... [2024-11-18 21:59:09,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:59:09,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:59:09,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 21:59:09,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 21:59:09,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 21:59:09,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 21:59:09,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 21:59:09,164 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 21:59:09,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 21:59:09,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 21:59:09,242 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 21:59:09,247 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 21:59:09,693 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-18 21:59:09,693 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 21:59:09,708 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 21:59:09,709 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 21:59:09,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:59:09 BoogieIcfgContainer [2024-11-18 21:59:09,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 21:59:09,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 21:59:09,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 21:59:09,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 21:59:09,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:59:08" (1/3) ... [2024-11-18 21:59:09,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76816f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:59:09, skipping insertion in model container [2024-11-18 21:59:09,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:59:08" (2/3) ... [2024-11-18 21:59:09,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76816f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:59:09, skipping insertion in model container [2024-11-18 21:59:09,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:59:09" (3/3) ... [2024-11-18 21:59:09,720 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-18.i [2024-11-18 21:59:09,740 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 21:59:09,740 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 21:59:09,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 21:59:09,817 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;@5229f244, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 21:59:09,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 21:59:09,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 21:59:09,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-18 21:59:09,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:59:09,836 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:59:09,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:59:09,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:59:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash -310559141, now seen corresponding path program 1 times [2024-11-18 21:59:09,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 21:59:09,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78950283] [2024-11-18 21:59:09,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:59:09,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 21:59:09,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 21:59:09,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 21:59:09,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 21:59:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:59:10,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 21:59:10,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:59:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-18 21:59:10,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:59:10,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 21:59:10,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78950283] [2024-11-18 21:59:10,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78950283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:59:10,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:59:10,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 21:59:10,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519683057] [2024-11-18 21:59:10,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:59:10,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 21:59:10,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 21:59:10,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 21:59:10,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 21:59:10,125 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-18 21:59:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:59:10,149 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2024-11-18 21:59:10,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 21:59:10,152 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2024-11-18 21:59:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:59:10,160 INFO L225 Difference]: With dead ends: 83 [2024-11-18 21:59:10,160 INFO L226 Difference]: Without dead ends: 41 [2024-11-18 21:59:10,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 21:59:10,170 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 21:59:10,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 21:59:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-18 21:59:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-18 21:59:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 21:59:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-11-18 21:59:10,211 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 80 [2024-11-18 21:59:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:59:10,211 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-11-18 21:59:10,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-18 21:59:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-11-18 21:59:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-18 21:59:10,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:59:10,215 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:59:10,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 21:59:10,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 21:59:10,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:59:10,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:59:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash 392918431, now seen corresponding path program 1 times [2024-11-18 21:59:10,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 21:59:10,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098049434] [2024-11-18 21:59:10,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:59:10,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 21:59:10,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 21:59:10,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 21:59:10,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 21:59:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:59:10,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 21:59:10,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:59:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-18 21:59:11,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 21:59:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-18 21:59:11,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 21:59:11,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098049434] [2024-11-18 21:59:11,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098049434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 21:59:11,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 21:59:11,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-18 21:59:11,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750253252] [2024-11-18 21:59:11,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 21:59:11,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 21:59:11,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 21:59:11,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 21:59:11,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-18 21:59:11,822 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-18 21:59:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:59:13,438 INFO L93 Difference]: Finished difference Result 213 states and 294 transitions. [2024-11-18 21:59:13,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-18 21:59:13,440 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 80 [2024-11-18 21:59:13,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:59:13,446 INFO L225 Difference]: With dead ends: 213 [2024-11-18 21:59:13,447 INFO L226 Difference]: Without dead ends: 175 [2024-11-18 21:59:13,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=494, Unknown=0, NotChecked=0, Total=756 [2024-11-18 21:59:13,450 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 149 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-18 21:59:13,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 280 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-18 21:59:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-18 21:59:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 88. [2024-11-18 21:59:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-18 21:59:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2024-11-18 21:59:13,492 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 80 [2024-11-18 21:59:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:59:13,492 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2024-11-18 21:59:13,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-18 21:59:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-11-18 21:59:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-18 21:59:13,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:59:13,499 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 21:59:13,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-18 21:59:13,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 21:59:13,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:59:13,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:59:13,701 INFO L85 PathProgramCache]: Analyzing trace with hash -938143787, now seen corresponding path program 1 times [2024-11-18 21:59:13,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 21:59:13,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946044071] [2024-11-18 21:59:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:59:13,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 21:59:13,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 21:59:13,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 21:59:13,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 21:59:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:59:13,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-18 21:59:13,824 INFO L278 TraceCheckSpWp]: Computing forward predicates...