./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.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 9be54bf039b1b69bac47621c18caa89883f4e5db7b74fe4f3e62990547785f77 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:34:01,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:34:01,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:34:01,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:34:01,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:34:01,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:34:01,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:34:01,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:34:01,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:34:01,428 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:34:01,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:34:01,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:34:01,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:34:01,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:34:01,430 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:34:01,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:34:01,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:34:01,431 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:34:01,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:34:01,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:34:01,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:34:01,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:34:01,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:34:01,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:34:01,435 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:34:01,435 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:34:01,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:34:01,436 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:34:01,436 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:34:01,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:34:01,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:34:01,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:34:01,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:34:01,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:34:01,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:34:01,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:34:01,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:34:01,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:34:01,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:34:01,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:34:01,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:34:01,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:34:01,440 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 -> 9be54bf039b1b69bac47621c18caa89883f4e5db7b74fe4f3e62990547785f77 [2024-10-24 10:34:01,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:34:01,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:34:01,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:34:01,720 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:34:01,720 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:34:01,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i [2024-10-24 10:34:03,158 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:34:03,354 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:34:03,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i [2024-10-24 10:34:03,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89bc0079a/7cef3087f57b4c4198833120695db4d5/FLAGefc670716 [2024-10-24 10:34:03,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89bc0079a/7cef3087f57b4c4198833120695db4d5 [2024-10-24 10:34:03,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:34:03,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:34:03,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:34:03,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:34:03,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:34:03,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:34:03" (1/1) ... [2024-10-24 10:34:03,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b48e8d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03, skipping insertion in model container [2024-10-24 10:34:03,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:34:03" (1/1) ... [2024-10-24 10:34:03,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:34:03,592 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i[915,928] [2024-10-24 10:34:03,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:34:03,644 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:34:03,655 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i[915,928] [2024-10-24 10:34:03,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:34:03,694 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:34:03,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03 WrapperNode [2024-10-24 10:34:03,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:34:03,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:34:03,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:34:03,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:34:03,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03" (1/1) ... [2024-10-24 10:34:03,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03" (1/1) ... [2024-10-24 10:34:03,742 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-10-24 10:34:03,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:34:03,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:34:03,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:34:03,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:34:03,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03" (1/1) ... [2024-10-24 10:34:03,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03" (1/1) ... [2024-10-24 10:34:03,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03" (1/1) ... [2024-10-24 10:34:03,773 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:34:03,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03" (1/1) ... [2024-10-24 10:34:03,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03" (1/1) ... [2024-10-24 10:34:03,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03" (1/1) ... [2024-10-24 10:34:03,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03" (1/1) ... [2024-10-24 10:34:03,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03" (1/1) ... [2024-10-24 10:34:03,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03" (1/1) ... [2024-10-24 10:34:03,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:34:03,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:34:03,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:34:03,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:34:03,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03" (1/1) ... [2024-10-24 10:34:03,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:34:03,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:34:03,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:34:03,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:34:03,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:34:03,884 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:34:03,884 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:34:03,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:34:03,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:34:03,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:34:03,951 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:34:03,953 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:34:04,165 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 10:34:04,166 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:34:04,206 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:34:04,207 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:34:04,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:04 BoogieIcfgContainer [2024-10-24 10:34:04,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:34:04,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:34:04,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:34:04,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:34:04,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:34:03" (1/3) ... [2024-10-24 10:34:04,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b84262d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:34:04, skipping insertion in model container [2024-10-24 10:34:04,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:03" (2/3) ... [2024-10-24 10:34:04,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b84262d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:34:04, skipping insertion in model container [2024-10-24 10:34:04,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:04" (3/3) ... [2024-10-24 10:34:04,220 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-33.i [2024-10-24 10:34:04,236 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:34:04,236 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:34:04,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:34:04,288 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;@17a5938f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:34:04,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:34:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 10:34:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 10:34:04,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:04,305 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:04,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:04,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:04,312 INFO L85 PathProgramCache]: Analyzing trace with hash -454185538, now seen corresponding path program 1 times [2024-10-24 10:34:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:04,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776173960] [2024-10-24 10:34:04,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:04,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:04,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:04,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:04,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:04,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:34:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:04,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:34:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:04,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:34:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:04,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:04,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:34:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:34:04,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:04,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776173960] [2024-10-24 10:34:04,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776173960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:04,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:04,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:34:04,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207251303] [2024-10-24 10:34:04,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:04,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:34:04,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:04,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:34:04,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:34:04,628 INFO L87 Difference]: Start difference. First operand has 44 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 10:34:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:04,660 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2024-10-24 10:34:04,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:34:04,665 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2024-10-24 10:34:04,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:04,678 INFO L225 Difference]: With dead ends: 83 [2024-10-24 10:34:04,678 INFO L226 Difference]: Without dead ends: 40 [2024-10-24 10:34:04,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:34:04,685 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:04,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:34:04,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-24 10:34:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-24 10:34:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 10:34:04,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2024-10-24 10:34:04,724 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 60 [2024-10-24 10:34:04,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:04,747 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-10-24 10:34:04,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 10:34:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2024-10-24 10:34:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 10:34:04,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:04,756 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:04,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:34:04,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:04,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:04,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1546567162, now seen corresponding path program 1 times [2024-10-24 10:34:04,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:04,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731723048] [2024-10-24 10:34:04,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:04,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:34:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:34:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:34:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:34:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:34:05,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:05,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731723048] [2024-10-24 10:34:05,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731723048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:05,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:05,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:34:05,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279907773] [2024-10-24 10:34:05,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:05,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:34:05,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:05,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:34:05,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:34:05,113 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:05,246 INFO L93 Difference]: Finished difference Result 131 states and 182 transitions. [2024-10-24 10:34:05,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:34:05,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 60 [2024-10-24 10:34:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:05,249 INFO L225 Difference]: With dead ends: 131 [2024-10-24 10:34:05,250 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 10:34:05,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:34:05,252 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 76 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:05,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 142 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:34:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 10:34:05,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2024-10-24 10:34:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:34:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2024-10-24 10:34:05,281 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 60 [2024-10-24 10:34:05,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:05,282 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2024-10-24 10:34:05,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2024-10-24 10:34:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 10:34:05,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:05,284 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:05,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:34:05,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1057377594, now seen corresponding path program 1 times [2024-10-24 10:34:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:05,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890606003] [2024-10-24 10:34:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:34:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:34:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:34:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:34:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:34:05,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890606003] [2024-10-24 10:34:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890606003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:05,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:05,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:34:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865512658] [2024-10-24 10:34:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:05,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:34:05,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:05,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:34:05,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:34:05,518 INFO L87 Difference]: Start difference. First operand 83 states and 113 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:05,683 INFO L93 Difference]: Finished difference Result 174 states and 233 transitions. [2024-10-24 10:34:05,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:34:05,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 64 [2024-10-24 10:34:05,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:05,686 INFO L225 Difference]: With dead ends: 174 [2024-10-24 10:34:05,686 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 10:34:05,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:34:05,687 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 71 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:05,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 208 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:34:05,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 10:34:05,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2024-10-24 10:34:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.25) internal successors, (80), 64 states have internal predecessors, (80), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:34:05,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2024-10-24 10:34:05,704 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 64 [2024-10-24 10:34:05,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:05,705 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2024-10-24 10:34:05,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2024-10-24 10:34:05,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 10:34:05,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:05,708 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:05,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:34:05,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:05,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:05,710 INFO L85 PathProgramCache]: Analyzing trace with hash 470571580, now seen corresponding path program 1 times [2024-10-24 10:34:05,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:05,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013055722] [2024-10-24 10:34:05,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:05,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:06,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:06,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:06,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:06,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:34:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:06,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:34:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:06,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:34:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:06,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:06,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:34:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:34:06,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:06,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013055722] [2024-10-24 10:34:06,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013055722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:06,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:06,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 10:34:06,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743503971] [2024-10-24 10:34:06,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:06,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 10:34:06,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:06,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 10:34:06,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:34:06,827 INFO L87 Difference]: Start difference. First operand 83 states and 112 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:07,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:07,087 INFO L93 Difference]: Finished difference Result 216 states and 287 transitions. [2024-10-24 10:34:07,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:34:07,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 64 [2024-10-24 10:34:07,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:07,090 INFO L225 Difference]: With dead ends: 216 [2024-10-24 10:34:07,090 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 10:34:07,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:34:07,093 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 63 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:07,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 237 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:34:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 10:34:07,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2024-10-24 10:34:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 88 states have internal predecessors, (107), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 10:34:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 155 transitions. [2024-10-24 10:34:07,126 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 155 transitions. Word has length 64 [2024-10-24 10:34:07,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:07,126 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 155 transitions. [2024-10-24 10:34:07,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 155 transitions. [2024-10-24 10:34:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 10:34:07,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:07,129 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:07,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 10:34:07,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:07,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash -338775046, now seen corresponding path program 1 times [2024-10-24 10:34:07,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:07,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86963819] [2024-10-24 10:34:07,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:07,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:09,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:09,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:09,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:09,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:34:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:09,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:34:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:09,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:34:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:09,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:09,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:34:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:34:09,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:09,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86963819] [2024-10-24 10:34:09,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86963819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:09,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:09,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 10:34:09,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268564850] [2024-10-24 10:34:09,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:09,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 10:34:09,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:09,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 10:34:09,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-24 10:34:09,144 INFO L87 Difference]: Start difference. First operand 116 states and 155 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:10,133 INFO L93 Difference]: Finished difference Result 143 states and 182 transitions. [2024-10-24 10:34:10,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 10:34:10,134 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 64 [2024-10-24 10:34:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:10,136 INFO L225 Difference]: With dead ends: 143 [2024-10-24 10:34:10,136 INFO L226 Difference]: Without dead ends: 141 [2024-10-24 10:34:10,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2024-10-24 10:34:10,137 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 117 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:10,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 203 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 10:34:10,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-24 10:34:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 128. [2024-10-24 10:34:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 100 states have (on average 1.19) internal successors, (119), 100 states have internal predecessors, (119), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 10:34:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 167 transitions. [2024-10-24 10:34:10,152 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 167 transitions. Word has length 64 [2024-10-24 10:34:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:10,153 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 167 transitions. [2024-10-24 10:34:10,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:10,153 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 167 transitions. [2024-10-24 10:34:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 10:34:10,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:10,155 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:10,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 10:34:10,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:10,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1407308995, now seen corresponding path program 1 times [2024-10-24 10:34:10,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:10,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735626997] [2024-10-24 10:34:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:10,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:34:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:34:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:34:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:34:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 10:34:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 10:34:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 10:34:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 10:34:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 10:34:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 10:34:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 10:34:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 10:34:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2024-10-24 10:34:10,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:10,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735626997] [2024-10-24 10:34:10,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735626997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:10,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:10,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:34:10,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362840788] [2024-10-24 10:34:10,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:10,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:34:10,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:10,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:34:10,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:34:10,415 INFO L87 Difference]: Start difference. First operand 128 states and 167 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 10:34:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:10,484 INFO L93 Difference]: Finished difference Result 138 states and 177 transitions. [2024-10-24 10:34:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:34:10,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 125 [2024-10-24 10:34:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:10,486 INFO L225 Difference]: With dead ends: 138 [2024-10-24 10:34:10,486 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 10:34:10,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:34:10,489 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:10,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 82 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:34:10,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 10:34:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2024-10-24 10:34:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:34:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2024-10-24 10:34:10,508 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 125 [2024-10-24 10:34:10,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:10,508 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 95 transitions. [2024-10-24 10:34:10,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 10:34:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2024-10-24 10:34:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 10:34:10,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:10,510 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:10,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 10:34:10,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:10,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:10,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1440264730, now seen corresponding path program 1 times [2024-10-24 10:34:10,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:10,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337096107] [2024-10-24 10:34:10,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:10,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:34:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:34:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:34:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:34:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:34:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:34:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:34:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:34:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 10:34:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 10:34:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 10:34:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 10:34:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 10:34:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 10:34:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 10:34:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 10:34:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 60 proven. 3 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-10-24 10:34:10,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:34:10,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337096107] [2024-10-24 10:34:10,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337096107] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:34:10,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554960782] [2024-10-24 10:34:10,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:10,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:34:10,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:34:10,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:34:10,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 10:34:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:10,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 10:34:11,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:34:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 329 proven. 3 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-10-24 10:34:15,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:34:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-24 10:34:17,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554960782] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:34:17,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 10:34:17,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2024-10-24 10:34:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414746305] [2024-10-24 10:34:17,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 10:34:17,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 10:34:17,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:34:17,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 10:34:17,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:34:17,932 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2024-10-24 10:34:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:18,151 INFO L93 Difference]: Finished difference Result 144 states and 169 transitions. [2024-10-24 10:34:18,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 10:34:18,152 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 127 [2024-10-24 10:34:18,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:18,154 INFO L225 Difference]: With dead ends: 144 [2024-10-24 10:34:18,155 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 10:34:18,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-24 10:34:18,156 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:18,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 139 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:34:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 10:34:18,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-10-24 10:34:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 69 states have internal predecessors, (73), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:34:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2024-10-24 10:34:18,178 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 127 [2024-10-24 10:34:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:18,178 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2024-10-24 10:34:18,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2024-10-24 10:34:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2024-10-24 10:34:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 10:34:18,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:18,181 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:18,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 10:34:18,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:34:18,383 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:18,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:18,383 INFO L85 PathProgramCache]: Analyzing trace with hash 977501222, now seen corresponding path program 1 times [2024-10-24 10:34:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:34:18,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575806929] [2024-10-24 10:34:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:18,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:34:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 10:34:18,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1200720243] [2024-10-24 10:34:18,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:18,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:34:18,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:34:18,443 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-10-24 10:34:18,444 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-10-24 10:34:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:34:18,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:34:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:34:18,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:34:18,917 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:34:18,918 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:34:18,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 10:34:19,120 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,SelfDestructingSolverStorable7 [2024-10-24 10:34:19,124 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:19,205 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:34:19,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:34:19 BoogieIcfgContainer [2024-10-24 10:34:19,208 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:34:19,208 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:34:19,208 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:34:19,209 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:34:19,209 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:04" (3/4) ... [2024-10-24 10:34:19,214 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:34:19,215 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:34:19,215 INFO L158 Benchmark]: Toolchain (without parser) took 15833.49ms. Allocated memory was 172.0MB in the beginning and 778.0MB in the end (delta: 606.1MB). Free memory was 117.5MB in the beginning and 450.0MB in the end (delta: -332.5MB). Peak memory consumption was 277.1MB. Max. memory is 16.1GB. [2024-10-24 10:34:19,215 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 172.0MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:34:19,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.67ms. Allocated memory is still 172.0MB. Free memory was 116.9MB in the beginning and 102.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:34:19,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.90ms. Allocated memory is still 172.0MB. Free memory was 102.2MB in the beginning and 100.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:34:19,216 INFO L158 Benchmark]: Boogie Preprocessor took 39.42ms. Allocated memory is still 172.0MB. Free memory was 100.1MB in the beginning and 97.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 10:34:19,216 INFO L158 Benchmark]: RCFGBuilder took 420.34ms. Allocated memory is still 172.0MB. Free memory was 97.3MB in the beginning and 78.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 10:34:19,216 INFO L158 Benchmark]: TraceAbstraction took 14998.06ms. Allocated memory was 172.0MB in the beginning and 778.0MB in the end (delta: 606.1MB). Free memory was 77.7MB in the beginning and 451.0MB in the end (delta: -373.3MB). Peak memory consumption was 235.1MB. Max. memory is 16.1GB. [2024-10-24 10:34:19,217 INFO L158 Benchmark]: Witness Printer took 6.33ms. Allocated memory is still 778.0MB. Free memory was 451.0MB in the beginning and 450.0MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:34:19,222 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 172.0MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.67ms. Allocated memory is still 172.0MB. Free memory was 116.9MB in the beginning and 102.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.90ms. Allocated memory is still 172.0MB. Free memory was 102.2MB in the beginning and 100.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.42ms. Allocated memory is still 172.0MB. Free memory was 100.1MB in the beginning and 97.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 420.34ms. Allocated memory is still 172.0MB. Free memory was 97.3MB in the beginning and 78.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14998.06ms. Allocated memory was 172.0MB in the beginning and 778.0MB in the end (delta: 606.1MB). Free memory was 77.7MB in the beginning and 451.0MB in the end (delta: -373.3MB). Peak memory consumption was 235.1MB. Max. memory is 16.1GB. * Witness Printer took 6.33ms. Allocated memory is still 778.0MB. Free memory was 451.0MB in the beginning and 450.0MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of bitwiseOr at line 83, overapproximation of someBinaryArithmeticFLOAToperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] unsigned char var_1_7 = 200; [L24] unsigned char var_1_8 = 4; [L25] signed char var_1_9 = 50; [L26] signed char var_1_12 = -5; [L27] float var_1_13 = 999999999999.8; [L28] float var_1_14 = 100.5; [L29] float var_1_15 = 32.75; [L30] unsigned char var_1_16 = 1; [L31] unsigned char var_1_17 = 1; [L32] unsigned char var_1_18 = 128; [L33] unsigned char last_1_var_1_7 = 200; [L34] signed char last_1_var_1_9 = 50; [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] CALL updateLastVariables() [L79] last_1_var_1_7 = var_1_7 [L80] last_1_var_1_9 = var_1_9 [L90] RET updateLastVariables() [L91] CALL updateVariables() [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L67] var_1_12 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L68] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L69] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L69] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L74] var_1_17 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L75] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L76] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L76] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L91] RET updateVariables() [L92] CALL step() [L38] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=-512, var_1_9=50] [L38] signed long int stepLocal_0 = (last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9; [L39] COND FALSE !(stepLocal_0 < -1) [L42] var_1_1 = (128 - (last_1_var_1_7 + last_1_var_1_7)) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-272, var_1_7=200, var_1_8=-512, var_1_9=50] [L44] var_1_16 = var_1_17 [L45] var_1_18 = var_1_8 [L46] signed short int stepLocal_2 = var_1_1; [L47] unsigned char stepLocal_1 = (var_1_1 * var_1_18) < -10000; VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=200, var_1_8=-512, var_1_9=50] [L48] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=200, var_1_8=-512, var_1_9=50] [L49] COND FALSE !(stepLocal_1 && var_1_16) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=200, var_1_8=-512, var_1_9=50] [L55] COND TRUE var_1_18 == var_1_18 [L56] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=-512, var_1_9=50] [L58] signed short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_2=-272, stepLocal_3=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=-512, var_1_9=50] [L59] COND FALSE !(var_1_18 == stepLocal_3) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=-512, var_1_9=50] [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=-512, var_1_9=50] [L83-L84] return ((((((((last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (last_1_var_1_7 + last_1_var_1_7))))) && ((var_1_18 == var_1_18) ? (var_1_7 == ((unsigned char) var_1_8)) : 1)) && (var_1_16 ? ((((var_1_1 * var_1_18) < -10000) && var_1_16) ? ((var_1_1 > var_1_1) ? (var_1_9 == ((signed char) var_1_12)) : 1) : 1) : 1)) && ((var_1_18 == var_1_1) ? (var_1_13 == ((float) (var_1_14 - var_1_15))) : 1)) && (var_1_16 == ((unsigned char) var_1_17))) && (var_1_18 == ((unsigned char) var_1_8)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND FALSE !(!(cond)) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=-512, var_1_9=50] [L93] RET __VERIFIER_assert(property()) [L94] isInitial = 0 VAL [isInitial=0, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=-512, var_1_9=50] [L89] COND TRUE 1 [L90] CALL updateLastVariables() [L79] last_1_var_1_7 = var_1_7 [L80] last_1_var_1_9 = var_1_9 [L90] RET updateLastVariables() [L91] CALL updateVariables() [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_9=50] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_9=50] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L67] var_1_12 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L68] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L69] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L69] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L74] var_1_17 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L75] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L76] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L76] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L91] RET updateVariables() [L92] CALL step() [L38] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=-272, var_1_7=-512, var_1_8=128, var_1_9=50] [L38] signed long int stepLocal_0 = (last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9; [L39] COND FALSE !(stepLocal_0 < -1) [L42] var_1_1 = (128 - (last_1_var_1_7 + last_1_var_1_7)) VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=-512, var_1_1=128, var_1_7=-512, var_1_8=128, var_1_9=50] [L44] var_1_16 = var_1_17 [L45] var_1_18 = var_1_8 [L46] signed short int stepLocal_2 = var_1_1; [L47] unsigned char stepLocal_1 = (var_1_1 * var_1_18) < -10000; VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=128, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=-512, var_1_8=128, var_1_9=50] [L48] COND TRUE \read(var_1_16) VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=128, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=-512, var_1_8=128, var_1_9=50] [L49] COND FALSE !(stepLocal_1 && var_1_16) VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, stepLocal_2=128, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=-512, var_1_8=128, var_1_9=50] [L55] COND TRUE var_1_18 == var_1_18 [L56] var_1_7 = var_1_8 VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, stepLocal_2=128, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L58] signed short int stepLocal_3 = var_1_1; VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, stepLocal_2=128, stepLocal_3=128, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L59] COND TRUE var_1_18 == stepLocal_3 [L60] var_1_13 = (var_1_14 - var_1_15) VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, stepLocal_2=128, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L83-L84] return ((((((((last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (last_1_var_1_7 + last_1_var_1_7))))) && ((var_1_18 == var_1_18) ? (var_1_7 == ((unsigned char) var_1_8)) : 1)) && (var_1_16 ? ((((var_1_1 * var_1_18) < -10000) && var_1_16) ? ((var_1_1 > var_1_1) ? (var_1_9 == ((signed char) var_1_12)) : 1) : 1) : 1)) && ((var_1_18 == var_1_1) ? (var_1_13 == ((float) (var_1_14 - var_1_15))) : 1)) && (var_1_16 == ((unsigned char) var_1_17))) && (var_1_18 == ((unsigned char) var_1_8)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L19] reach_error() VAL [isInitial=0, last_1_var_1_7=-512, last_1_var_1_9=50, var_1_12=-127, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 414 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 408 mSDsluCounter, 1064 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 757 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 525 IncrementalHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 307 mSDtfsCounter, 525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 416 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=5, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 61 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 809 ConstructedInterpolants, 0 QuantifiedInterpolants, 3905 SizeOfPredicates, 15 NumberOfNonLiveVariables, 286 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 2563/2596 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 10:34:19,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.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 9be54bf039b1b69bac47621c18caa89883f4e5db7b74fe4f3e62990547785f77 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:34:21,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:34:21,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:34:21,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:34:21,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:34:21,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:34:21,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:34:21,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:34:21,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:34:21,555 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:34:21,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:34:21,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:34:21,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:34:21,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:34:21,559 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:34:21,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:34:21,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:34:21,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:34:21,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:34:21,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:34:21,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:34:21,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:34:21,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:34:21,566 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:34:21,567 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:34:21,567 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:34:21,567 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:34:21,567 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:34:21,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:34:21,568 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:34:21,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:34:21,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:34:21,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:34:21,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:34:21,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:34:21,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:34:21,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:34:21,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:34:21,571 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:34:21,572 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:34:21,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:34:21,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:34:21,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:34:21,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:34:21,573 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:34:21,573 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 -> 9be54bf039b1b69bac47621c18caa89883f4e5db7b74fe4f3e62990547785f77 [2024-10-24 10:34:21,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:34:21,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:34:21,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:34:21,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:34:21,917 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:34:21,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i [2024-10-24 10:34:23,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:34:23,645 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:34:23,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i [2024-10-24 10:34:23,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00875580/1af68db84211439baa273c7272e59159/FLAG1202334a6 [2024-10-24 10:34:23,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00875580/1af68db84211439baa273c7272e59159 [2024-10-24 10:34:23,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:34:23,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:34:23,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:34:23,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:34:23,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:34:23,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:34:23" (1/1) ... [2024-10-24 10:34:23,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9c6ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:23, skipping insertion in model container [2024-10-24 10:34:23,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:34:23" (1/1) ... [2024-10-24 10:34:23,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:34:23,893 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i[915,928] [2024-10-24 10:34:23,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:34:23,960 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:34:23,973 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i[915,928] [2024-10-24 10:34:23,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:34:24,027 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:34:24,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:24 WrapperNode [2024-10-24 10:34:24,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:34:24,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:34:24,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:34:24,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:34:24,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:24" (1/1) ... [2024-10-24 10:34:24,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:24" (1/1) ... [2024-10-24 10:34:24,071 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-10-24 10:34:24,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:34:24,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:34:24,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:34:24,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:34:24,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:24" (1/1) ... [2024-10-24 10:34:24,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:24" (1/1) ... [2024-10-24 10:34:24,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:24" (1/1) ... [2024-10-24 10:34:24,116 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:34:24,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:24" (1/1) ... [2024-10-24 10:34:24,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:24" (1/1) ... [2024-10-24 10:34:24,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:24" (1/1) ... [2024-10-24 10:34:24,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:24" (1/1) ... [2024-10-24 10:34:24,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:24" (1/1) ... [2024-10-24 10:34:24,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:24" (1/1) ... [2024-10-24 10:34:24,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:34:24,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:34:24,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:34:24,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:34:24,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:24" (1/1) ... [2024-10-24 10:34:24,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:34:24,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:34:24,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:34:24,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:34:24,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:34:24,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:34:24,228 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:34:24,229 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:34:24,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:34:24,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:34:24,312 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:34:24,314 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:34:24,646 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 10:34:24,650 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:34:24,717 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:34:24,719 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:34:24,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:24 BoogieIcfgContainer [2024-10-24 10:34:24,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:34:24,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:34:24,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:34:24,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:34:24,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:34:23" (1/3) ... [2024-10-24 10:34:24,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65850dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:34:24, skipping insertion in model container [2024-10-24 10:34:24,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:34:24" (2/3) ... [2024-10-24 10:34:24,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65850dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:34:24, skipping insertion in model container [2024-10-24 10:34:24,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:34:24" (3/3) ... [2024-10-24 10:34:24,747 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-33.i [2024-10-24 10:34:24,763 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:34:24,763 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:34:24,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:34:24,827 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;@2301ee69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:34:24,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:34:24,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 10:34:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 10:34:24,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:24,841 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:24,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:24,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:24,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2069998517, now seen corresponding path program 1 times [2024-10-24 10:34:24,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:34:24,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330184692] [2024-10-24 10:34:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:24,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:24,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:34:24,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-10-24 10:34:24,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-10-24 10:34:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:25,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:34:25,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:34:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-24 10:34:25,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:34:25,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:34:25,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330184692] [2024-10-24 10:34:25,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330184692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:25,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:25,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:34:25,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018718982] [2024-10-24 10:34:25,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:25,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:34:25,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:34:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:34:25,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:34:25,115 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 10:34:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:25,197 INFO L93 Difference]: Finished difference Result 65 states and 106 transitions. [2024-10-24 10:34:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:34:25,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2024-10-24 10:34:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:25,210 INFO L225 Difference]: With dead ends: 65 [2024-10-24 10:34:25,210 INFO L226 Difference]: Without dead ends: 32 [2024-10-24 10:34:25,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:34:25,217 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:25,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:34:25,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-24 10:34:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-24 10:34:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 10:34:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2024-10-24 10:34:25,260 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 56 [2024-10-24 10:34:25,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:25,261 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2024-10-24 10:34:25,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 10:34:25,262 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2024-10-24 10:34:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 10:34:25,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:25,264 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:25,273 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 (2)] Forceful destruction successful, exit code 0 [2024-10-24 10:34:25,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:25,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:25,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:25,472 INFO L85 PathProgramCache]: Analyzing trace with hash 592198129, now seen corresponding path program 1 times [2024-10-24 10:34:25,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:34:25,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364262042] [2024-10-24 10:34:25,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:25,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:25,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:34:25,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:34:25,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 10:34:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:25,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 10:34:25,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:34:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:34:25,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:34:25,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:34:25,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364262042] [2024-10-24 10:34:25,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364262042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:25,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:25,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:34:25,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336260839] [2024-10-24 10:34:25,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:25,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:34:25,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:34:25,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:34:25,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:34:25,814 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:25,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:25,988 INFO L93 Difference]: Finished difference Result 103 states and 140 transitions. [2024-10-24 10:34:25,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:34:25,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2024-10-24 10:34:25,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:25,992 INFO L225 Difference]: With dead ends: 103 [2024-10-24 10:34:25,992 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 10:34:25,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:34:25,994 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 52 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:25,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 157 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:34:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 10:34:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2024-10-24 10:34:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:34:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2024-10-24 10:34:26,009 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 56 [2024-10-24 10:34:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:26,009 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2024-10-24 10:34:26,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2024-10-24 10:34:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 10:34:26,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:26,011 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:26,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 10:34:26,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:26,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:26,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:26,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1272256499, now seen corresponding path program 1 times [2024-10-24 10:34:26,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:34:26,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335078370] [2024-10-24 10:34:26,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:26,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:26,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:34:26,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:34:26,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 10:34:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:26,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 10:34:26,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:34:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 10:34:26,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:34:26,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:34:26,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335078370] [2024-10-24 10:34:26,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335078370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:26,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:26,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 10:34:26,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862142107] [2024-10-24 10:34:26,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:26,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 10:34:26,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:34:26,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 10:34:26,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:34:26,482 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 10:34:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:26,827 INFO L93 Difference]: Finished difference Result 141 states and 185 transitions. [2024-10-24 10:34:26,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 10:34:26,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2024-10-24 10:34:26,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:26,835 INFO L225 Difference]: With dead ends: 141 [2024-10-24 10:34:26,836 INFO L226 Difference]: Without dead ends: 81 [2024-10-24 10:34:26,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2024-10-24 10:34:26,838 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 78 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:26,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 66 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:34:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-24 10:34:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-10-24 10:34:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:34:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2024-10-24 10:34:26,866 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 56 [2024-10-24 10:34:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:26,866 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2024-10-24 10:34:26,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 10:34:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2024-10-24 10:34:26,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 10:34:26,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:26,870 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:26,878 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 (4)] Forceful destruction successful, exit code 0 [2024-10-24 10:34:27,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:27,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:27,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash 119322627, now seen corresponding path program 1 times [2024-10-24 10:34:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:34:27,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711875079] [2024-10-24 10:34:27,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:27,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:27,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:34:27,079 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:34:27,080 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 (5)] Waiting until timeout for monitored process [2024-10-24 10:34:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:27,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 10:34:27,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:34:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:34:27,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:34:27,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:34:27,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711875079] [2024-10-24 10:34:27,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711875079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:27,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:27,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:34:27,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691492471] [2024-10-24 10:34:27,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:27,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:34:27,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:34:27,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:34:27,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:34:27,363 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:27,747 INFO L93 Difference]: Finished difference Result 252 states and 309 transitions. [2024-10-24 10:34:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 10:34:27,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2024-10-24 10:34:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:27,750 INFO L225 Difference]: With dead ends: 252 [2024-10-24 10:34:27,750 INFO L226 Difference]: Without dead ends: 176 [2024-10-24 10:34:27,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 10:34:27,752 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:27,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 225 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 10:34:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-24 10:34:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 114. [2024-10-24 10:34:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.1375) internal successors, (91), 80 states have internal predecessors, (91), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 10:34:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 139 transitions. [2024-10-24 10:34:27,790 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 139 transitions. Word has length 57 [2024-10-24 10:34:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:27,791 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 139 transitions. [2024-10-24 10:34:27,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2024-10-24 10:34:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 10:34:27,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:27,792 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:27,801 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 (5)] Ended with exit code 0 [2024-10-24 10:34:27,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:27,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:27,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash 119382209, now seen corresponding path program 1 times [2024-10-24 10:34:27,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:34:27,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396920035] [2024-10-24 10:34:27,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:27,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:27,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:34:27,998 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:34:27,998 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 (6)] Waiting until timeout for monitored process [2024-10-24 10:34:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:28,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 10:34:28,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:34:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:34:41,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:34:41,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:34:41,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396920035] [2024-10-24 10:34:41,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396920035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:41,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:41,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 10:34:41,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291022687] [2024-10-24 10:34:41,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:41,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:34:41,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:34:41,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:34:41,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:34:41,605 INFO L87 Difference]: Start difference. First operand 114 states and 139 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:41,983 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2024-10-24 10:34:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 10:34:41,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2024-10-24 10:34:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:41,986 INFO L225 Difference]: With dead ends: 120 [2024-10-24 10:34:41,986 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 10:34:41,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-24 10:34:41,987 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:41,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 149 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 10:34:41,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 10:34:42,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-10-24 10:34:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 10:34:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 141 transitions. [2024-10-24 10:34:42,006 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 141 transitions. Word has length 57 [2024-10-24 10:34:42,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:42,007 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 141 transitions. [2024-10-24 10:34:42,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2024-10-24 10:34:42,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 10:34:42,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:42,008 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:42,016 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 (6)] Ended with exit code 0 [2024-10-24 10:34:42,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:42,210 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:42,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:42,210 INFO L85 PathProgramCache]: Analyzing trace with hash 462546854, now seen corresponding path program 1 times [2024-10-24 10:34:42,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:34:42,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648304221] [2024-10-24 10:34:42,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:42,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:42,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:34:42,212 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:34:42,213 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 (7)] Waiting until timeout for monitored process [2024-10-24 10:34:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:42,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 10:34:42,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:34:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:34:42,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:34:42,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:34:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648304221] [2024-10-24 10:34:42,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648304221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:34:42,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:34:42,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:34:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744070071] [2024-10-24 10:34:42,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:34:42,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:34:42,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:34:42,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:34:42,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:34:42,342 INFO L87 Difference]: Start difference. First operand 116 states and 141 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:34:42,433 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2024-10-24 10:34:42,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:34:42,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2024-10-24 10:34:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:34:42,439 INFO L225 Difference]: With dead ends: 126 [2024-10-24 10:34:42,439 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 10:34:42,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:34:42,440 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:34:42,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 66 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:34:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 10:34:42,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2024-10-24 10:34:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:34:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2024-10-24 10:34:42,462 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 58 [2024-10-24 10:34:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:34:42,462 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2024-10-24 10:34:42,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:34:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2024-10-24 10:34:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 10:34:42,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:34:42,464 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:34:42,471 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 (7)] Ended with exit code 0 [2024-10-24 10:34:42,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:42,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:34:42,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:34:42,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1335521840, now seen corresponding path program 1 times [2024-10-24 10:34:42,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:34:42,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501284477] [2024-10-24 10:34:42,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:34:42,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:34:42,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:34:42,672 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:34:42,673 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 (8)] Waiting until timeout for monitored process [2024-10-24 10:34:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:34:42,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 10:34:42,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:35:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 345 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-10-24 10:35:03,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:35:21,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:35:21,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501284477] [2024-10-24 10:35:21,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501284477] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:35:21,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2078741677] [2024-10-24 10:35:21,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:35:21,574 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 10:35:21,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 10:35:21,578 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 10:35:21,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-24 10:35:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:35:21,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 10:35:21,973 INFO L278 TraceCheckSpWp]: Computing forward predicates...