./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_loopvsstraightlinecode_50-1loop_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93e3c3bb67a4613ef517536c02b2baa8489f9a353eac0e6ca61ce50a9ad293d5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:48:52,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:48:52,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:48:52,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:48:52,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:48:52,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:48:52,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:48:52,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:48:52,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:48:52,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:48:52,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:48:52,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:48:52,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:48:52,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:48:52,817 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:48:52,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:48:52,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:48:52,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:48:52,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:48:52,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:48:52,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:48:52,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:48:52,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:48:52,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:48:52,821 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:48:52,821 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:48:52,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:48:52,821 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:48:52,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:48:52,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:48:52,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:48:52,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:48:52,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:48:52,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:48:52,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:48:52,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:48:52,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:48:52,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:48:52,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:48:52,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:48:52,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:48:52,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:48:52,826 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93e3c3bb67a4613ef517536c02b2baa8489f9a353eac0e6ca61ce50a9ad293d5 [2024-10-11 11:48:53,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:48:53,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:48:53,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:48:53,127 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:48:53,128 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:48:53,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i [2024-10-11 11:48:54,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:48:54,797 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:48:54,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i [2024-10-11 11:48:54,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ccd545f01/c23705cb5d31447f8c857e2ee1d23398/FLAGac0f7facb [2024-10-11 11:48:55,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ccd545f01/c23705cb5d31447f8c857e2ee1d23398 [2024-10-11 11:48:55,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:48:55,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:48:55,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:48:55,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:48:55,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:48:55,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:48:55" (1/1) ... [2024-10-11 11:48:55,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489118d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55, skipping insertion in model container [2024-10-11 11:48:55,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:48:55" (1/1) ... [2024-10-11 11:48:55,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:48:55,376 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_loopvsstraightlinecode_50-1loop_file-42.i[915,928] [2024-10-11 11:48:55,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:48:55,479 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:48:55,490 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_loopvsstraightlinecode_50-1loop_file-42.i[915,928] [2024-10-11 11:48:55,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:48:55,553 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:48:55,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55 WrapperNode [2024-10-11 11:48:55,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:48:55,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:48:55,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:48:55,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:48:55,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55" (1/1) ... [2024-10-11 11:48:55,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55" (1/1) ... [2024-10-11 11:48:55,619 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-10-11 11:48:55,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:48:55,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:48:55,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:48:55,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:48:55,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55" (1/1) ... [2024-10-11 11:48:55,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55" (1/1) ... [2024-10-11 11:48:55,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55" (1/1) ... [2024-10-11 11:48:55,660 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-11 11:48:55,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55" (1/1) ... [2024-10-11 11:48:55,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55" (1/1) ... [2024-10-11 11:48:55,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55" (1/1) ... [2024-10-11 11:48:55,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55" (1/1) ... [2024-10-11 11:48:55,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55" (1/1) ... [2024-10-11 11:48:55,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55" (1/1) ... [2024-10-11 11:48:55,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:48:55,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:48:55,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:48:55,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:48:55,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55" (1/1) ... [2024-10-11 11:48:55,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:48:55,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:48:55,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:48:55,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:48:55,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:48:55,762 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:48:55,763 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:48:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:48:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:48:55,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:48:55,830 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:48:55,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:48:56,157 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-11 11:48:56,157 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:48:56,221 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:48:56,222 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:48:56,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:48:56 BoogieIcfgContainer [2024-10-11 11:48:56,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:48:56,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:48:56,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:48:56,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:48:56,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:48:55" (1/3) ... [2024-10-11 11:48:56,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337ff6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:48:56, skipping insertion in model container [2024-10-11 11:48:56,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:55" (2/3) ... [2024-10-11 11:48:56,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337ff6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:48:56, skipping insertion in model container [2024-10-11 11:48:56,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:48:56" (3/3) ... [2024-10-11 11:48:56,232 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-42.i [2024-10-11 11:48:56,246 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:48:56,246 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:48:56,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:48:56,303 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;@7c3ea181, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:48:56,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:48:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:48:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 11:48:56,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:56,319 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:48:56,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:56,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:56,326 INFO L85 PathProgramCache]: Analyzing trace with hash -594917490, now seen corresponding path program 1 times [2024-10-11 11:48:56,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:56,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007841230] [2024-10-11 11:48:56,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:56,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:56,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:56,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:56,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:48:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:56,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:56,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:48:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:56,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:56,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:48:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:56,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:56,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:48:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:48:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:56,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:48:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:56,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:48:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:48:56,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:56,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007841230] [2024-10-11 11:48:56,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007841230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:56,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:56,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:48:56,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018468815] [2024-10-11 11:48:56,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:56,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:48:56,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:56,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:48:56,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:48:56,813 INFO L87 Difference]: Start difference. First operand has 47 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:48:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:56,866 INFO L93 Difference]: Finished difference Result 93 states and 155 transitions. [2024-10-11 11:48:56,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:48:56,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2024-10-11 11:48:56,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:56,875 INFO L225 Difference]: With dead ends: 93 [2024-10-11 11:48:56,876 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 11:48:56,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:48:56,885 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:56,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:48:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 11:48:56,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 11:48:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:48:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2024-10-11 11:48:56,930 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 83 [2024-10-11 11:48:56,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:56,931 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-10-11 11:48:56,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:48:56,932 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2024-10-11 11:48:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 11:48:56,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:56,937 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:48:56,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:48:56,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:56,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:56,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1332087086, now seen corresponding path program 1 times [2024-10-11 11:48:56,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:56,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527690724] [2024-10-11 11:48:56,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:56,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:48:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:48:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:48:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:48:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:48:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:48:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:48:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:48:57,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:57,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527690724] [2024-10-11 11:48:57,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527690724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:57,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:57,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:48:57,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384341329] [2024-10-11 11:48:57,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:57,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:48:57,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:57,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:48:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:48:57,431 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:48:57,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:57,553 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2024-10-11 11:48:57,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:48:57,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-10-11 11:48:57,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:57,557 INFO L225 Difference]: With dead ends: 134 [2024-10-11 11:48:57,557 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 11:48:57,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-11 11:48:57,559 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 66 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:57,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 183 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:48:57,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 11:48:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2024-10-11 11:48:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 11:48:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 103 transitions. [2024-10-11 11:48:57,601 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 103 transitions. Word has length 83 [2024-10-11 11:48:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:57,602 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 103 transitions. [2024-10-11 11:48:57,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:48:57,606 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 103 transitions. [2024-10-11 11:48:57,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 11:48:57,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:57,607 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:48:57,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:48:57,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:57,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:57,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1817740538, now seen corresponding path program 1 times [2024-10-11 11:48:57,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:57,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416712403] [2024-10-11 11:48:57,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:57,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:48:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:48:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:48:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:48:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:48:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:48:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:48:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:48:57,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:57,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416712403] [2024-10-11 11:48:57,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416712403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:57,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:57,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:48:57,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322017992] [2024-10-11 11:48:57,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:57,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:48:57,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:57,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:48:57,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:48:57,988 INFO L87 Difference]: Start difference. First operand 70 states and 103 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:48:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:58,303 INFO L93 Difference]: Finished difference Result 201 states and 301 transitions. [2024-10-11 11:48:58,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:48:58,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-10-11 11:48:58,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:58,312 INFO L225 Difference]: With dead ends: 201 [2024-10-11 11:48:58,313 INFO L226 Difference]: Without dead ends: 157 [2024-10-11 11:48:58,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:48:58,314 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 95 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:58,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 273 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:48:58,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-11 11:48:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 112. [2024-10-11 11:48:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 72 states have internal predecessors, (95), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 11:48:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2024-10-11 11:48:58,378 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 167 transitions. Word has length 84 [2024-10-11 11:48:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:58,379 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 167 transitions. [2024-10-11 11:48:58,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:48:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 167 transitions. [2024-10-11 11:48:58,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 11:48:58,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:58,381 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:48:58,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:48:58,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:58,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1466109508, now seen corresponding path program 1 times [2024-10-11 11:48:58,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:58,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573865716] [2024-10-11 11:48:58,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:58,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:58,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:58,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:48:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:58,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:48:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:58,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:58,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:48:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:58,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:58,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:48:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:58,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:48:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:58,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:48:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:58,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:48:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:48:58,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:58,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573865716] [2024-10-11 11:48:58,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573865716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:58,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:58,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:48:58,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895703999] [2024-10-11 11:48:58,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:58,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:48:58,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:58,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:48:58,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:48:58,624 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:48:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:58,664 INFO L93 Difference]: Finished difference Result 198 states and 297 transitions. [2024-10-11 11:48:58,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:48:58,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-10-11 11:48:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:58,666 INFO L225 Difference]: With dead ends: 198 [2024-10-11 11:48:58,667 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 11:48:58,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:48:58,668 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:58,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:48:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 11:48:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 11:48:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 11:48:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 165 transitions. [2024-10-11 11:48:58,694 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 165 transitions. Word has length 84 [2024-10-11 11:48:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:58,695 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 165 transitions. [2024-10-11 11:48:58,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:48:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 165 transitions. [2024-10-11 11:48:58,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 11:48:58,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:58,700 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:48:58,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:48:58,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:58,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:58,701 INFO L85 PathProgramCache]: Analyzing trace with hash 656762882, now seen corresponding path program 1 times [2024-10-11 11:48:58,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:58,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903598257] [2024-10-11 11:48:58,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:58,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:59,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:59,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:48:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:59,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:59,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:48:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:59,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:59,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:48:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:59,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:48:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:59,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:48:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:59,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:48:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:59,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:48:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-11 11:48:59,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:59,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903598257] [2024-10-11 11:48:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903598257] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:48:59,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918602337] [2024-10-11 11:48:59,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:59,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:48:59,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:48:59,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:48:59,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:48:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:59,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 11:48:59,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:48:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 11:48:59,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:49:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-10-11 11:49:00,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918602337] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:49:00,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:49:00,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-10-11 11:49:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346823539] [2024-10-11 11:49:00,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:49:00,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 11:49:00,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:49:00,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 11:49:00,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-11 11:49:00,058 INFO L87 Difference]: Start difference. First operand 112 states and 165 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 11:49:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:49:00,971 INFO L93 Difference]: Finished difference Result 367 states and 496 transitions. [2024-10-11 11:49:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-11 11:49:00,972 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 84 [2024-10-11 11:49:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:49:00,975 INFO L225 Difference]: With dead ends: 367 [2024-10-11 11:49:00,976 INFO L226 Difference]: Without dead ends: 323 [2024-10-11 11:49:00,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=482, Invalid=1410, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 11:49:00,980 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 257 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:49:00,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 387 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 11:49:00,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-11 11:49:01,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 195. [2024-10-11 11:49:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 134 states have internal predecessors, (168), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 11:49:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2024-10-11 11:49:01,035 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 84 [2024-10-11 11:49:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:49:01,035 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2024-10-11 11:49:01,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 11:49:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2024-10-11 11:49:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 11:49:01,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:01,037 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:49:01,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:49:01,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:49:01,241 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:01,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:01,241 INFO L85 PathProgramCache]: Analyzing trace with hash 69956868, now seen corresponding path program 1 times [2024-10-11 11:49:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:49:01,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314017684] [2024-10-11 11:49:01,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:49:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:49:01,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1523049828] [2024-10-11 11:49:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:01,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:49:01,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:49:01,294 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:49:01,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:49:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:01,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 11:49:01,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:49:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-11 11:49:01,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:49:02,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:49:02,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314017684] [2024-10-11 11:49:02,344 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 11:49:02,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523049828] [2024-10-11 11:49:02,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523049828] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:49:02,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:49:02,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-10-11 11:49:02,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582306545] [2024-10-11 11:49:02,345 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 11:49:02,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 11:49:02,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:49:02,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 11:49:02,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=114, Unknown=2, NotChecked=0, Total=156 [2024-10-11 11:49:02,346 INFO L87 Difference]: Start difference. First operand 195 states and 264 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:49:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:49:02,928 INFO L93 Difference]: Finished difference Result 590 states and 779 transitions. [2024-10-11 11:49:02,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 11:49:02,928 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 84 [2024-10-11 11:49:02,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:49:02,932 INFO L225 Difference]: With dead ends: 590 [2024-10-11 11:49:02,932 INFO L226 Difference]: Without dead ends: 489 [2024-10-11 11:49:02,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=387, Unknown=2, NotChecked=0, Total=552 [2024-10-11 11:49:02,933 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 140 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 40 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:49:02,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 370 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 307 Invalid, 6 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:49:02,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-11 11:49:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 405. [2024-10-11 11:49:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 289 states have (on average 1.2560553633217992) internal successors, (363), 291 states have internal predecessors, (363), 88 states have call successors, (88), 27 states have call predecessors, (88), 27 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 11:49:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 539 transitions. [2024-10-11 11:49:03,002 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 539 transitions. Word has length 84 [2024-10-11 11:49:03,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:49:03,003 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 539 transitions. [2024-10-11 11:49:03,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:49:03,003 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 539 transitions. [2024-10-11 11:49:03,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 11:49:03,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:03,005 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:49:03,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 11:49:03,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:49:03,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:03,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:03,206 INFO L85 PathProgramCache]: Analyzing trace with hash 328122306, now seen corresponding path program 1 times [2024-10-11 11:49:03,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:49:03,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503187021] [2024-10-11 11:49:03,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:03,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:49:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:49:03,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453873829] [2024-10-11 11:49:03,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:03,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:49:03,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:49:03,276 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:49:03,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 11:49:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:03,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 11:49:03,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:49:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-11 11:49:04,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:49:04,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:49:04,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503187021] [2024-10-11 11:49:04,531 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 11:49:04,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453873829] [2024-10-11 11:49:04,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453873829] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:49:04,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:49:04,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-11 11:49:04,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694593963] [2024-10-11 11:49:04,532 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 11:49:04,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 11:49:04,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:49:04,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 11:49:04,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-10-11 11:49:04,533 INFO L87 Difference]: Start difference. First operand 405 states and 539 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:49:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:49:05,182 INFO L93 Difference]: Finished difference Result 800 states and 1071 transitions. [2024-10-11 11:49:05,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 11:49:05,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 84 [2024-10-11 11:49:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:49:05,189 INFO L225 Difference]: With dead ends: 800 [2024-10-11 11:49:05,189 INFO L226 Difference]: Without dead ends: 645 [2024-10-11 11:49:05,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-10-11 11:49:05,191 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 88 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 34 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:49:05,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 487 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 452 Invalid, 6 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:49:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-11 11:49:05,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 512. [2024-10-11 11:49:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 364 states have (on average 1.2472527472527473) internal successors, (454), 366 states have internal predecessors, (454), 112 states have call successors, (112), 35 states have call predecessors, (112), 35 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-11 11:49:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 678 transitions. [2024-10-11 11:49:05,281 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 678 transitions. Word has length 84 [2024-10-11 11:49:05,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:49:05,281 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 678 transitions. [2024-10-11 11:49:05,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:49:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 678 transitions. [2024-10-11 11:49:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 11:49:05,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:05,284 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:49:05,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 11:49:05,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:49:05,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:05,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash -935442791, now seen corresponding path program 1 times [2024-10-11 11:49:05,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:49:05,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729451216] [2024-10-11 11:49:05,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:05,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:49:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:49:05,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1169984591] [2024-10-11 11:49:05,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:05,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:49:05,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:49:05,556 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:49:05,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 11:49:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:49:05,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:49:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:49:05,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:49:05,741 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:49:05,742 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:49:05,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 11:49:05,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 11:49:05,948 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:49:06,015 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:49:06,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:49:06 BoogieIcfgContainer [2024-10-11 11:49:06,022 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:49:06,023 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:49:06,023 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:49:06,024 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:49:06,024 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:48:56" (3/4) ... [2024-10-11 11:49:06,026 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:49:06,027 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:49:06,028 INFO L158 Benchmark]: Toolchain (without parser) took 10861.74ms. Allocated memory was 174.1MB in the beginning and 255.9MB in the end (delta: 81.8MB). Free memory was 140.3MB in the beginning and 156.9MB in the end (delta: -16.5MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2024-10-11 11:49:06,029 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 117.4MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:49:06,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.70ms. Allocated memory is still 174.1MB. Free memory was 140.3MB in the beginning and 124.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 11:49:06,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.55ms. Allocated memory is still 174.1MB. Free memory was 124.6MB in the beginning and 121.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:49:06,030 INFO L158 Benchmark]: Boogie Preprocessor took 73.48ms. Allocated memory is still 174.1MB. Free memory was 121.5MB in the beginning and 116.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:49:06,031 INFO L158 Benchmark]: RCFGBuilder took 528.11ms. Allocated memory is still 174.1MB. Free memory was 116.2MB in the beginning and 92.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 11:49:06,031 INFO L158 Benchmark]: TraceAbstraction took 9797.68ms. Allocated memory was 174.1MB in the beginning and 255.9MB in the end (delta: 81.8MB). Free memory was 92.1MB in the beginning and 156.9MB in the end (delta: -64.8MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-10-11 11:49:06,032 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 255.9MB. Free memory is still 156.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:49:06,033 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.11ms. Allocated memory is still 117.4MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.70ms. Allocated memory is still 174.1MB. Free memory was 140.3MB in the beginning and 124.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.55ms. Allocated memory is still 174.1MB. Free memory was 124.6MB in the beginning and 121.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.48ms. Allocated memory is still 174.1MB. Free memory was 121.5MB in the beginning and 116.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 528.11ms. Allocated memory is still 174.1MB. Free memory was 116.2MB in the beginning and 92.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9797.68ms. Allocated memory was 174.1MB in the beginning and 255.9MB in the end (delta: 81.8MB). Free memory was 92.1MB in the beginning and 156.9MB in the end (delta: -64.8MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 255.9MB. Free memory is still 156.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] signed short int last_1_var_1_1 = 16; [L37] unsigned char last_1_var_1_6 = 10; [L38] unsigned char last_1_var_1_8 = 1; [L39] signed short int last_1_var_1_13 = 200; [L127] isInitial = 1 [L128] FCALL initially() [L129] int k_loop; [L130] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L130] COND TRUE k_loop < 1 [L131] CALL updateLastVariables() [L117] last_1_var_1_1 = var_1_1 [L118] last_1_var_1_6 = var_1_6 [L119] last_1_var_1_8 = var_1_8 [L120] last_1_var_1_13 = var_1_13 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L96] var_1_5 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L97] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L98] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L98] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L100] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L101] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L101] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L104] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L104] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L105] var_1_12 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L106] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L107] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L107] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L108] var_1_15 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L109] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L110] var_1_16 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L111] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L112] var_1_20 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L114] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L114] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L132] RET updateVariables() [L133] CALL step() [L43] signed long int stepLocal_6 = last_1_var_1_1; [L44] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L45] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L46] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L49] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L54] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=10, var_1_7=254, var_1_8=1] [L57] COND TRUE var_1_5 >= -2 [L58] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L60] unsigned char stepLocal_4 = var_1_6; [L61] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=154, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L62] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=154, var_1_11=-255, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L63] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L64] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L71] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=154, var_1_11=-255, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L72] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L75] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=-255, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L76] COND TRUE \read(var_1_19) [L77] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=-255, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L83] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L84] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=254, stepLocal_2=1, var_1_11=-255, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=1] [L85] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L92] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=254, var_1_11=-255, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] [L133] RET step() [L134] CALL, EXPR property() [L123-L124] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=-255, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_5=127, var_1_6=154, var_1_7=254, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 8, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 660 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 1877 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1363 mSDsCounter, 246 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1360 IncrementalHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 246 mSolverCounterUnsat, 514 mSDtfsCounter, 1360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 681 GetRequests, 580 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=512occurred in iteration=7, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 410 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1008 NumberOfCodeBlocks, 1008 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 745 ConstructedInterpolants, 2 QuantifiedInterpolants, 3401 SizeOfPredicates, 15 NumberOfNonLiveVariables, 675 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 2292/2376 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:49:06,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93e3c3bb67a4613ef517536c02b2baa8489f9a353eac0e6ca61ce50a9ad293d5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:49:08,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:49:08,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:49:08,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:49:08,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:49:08,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:49:08,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:49:08,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:49:08,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:49:08,309 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:49:08,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:49:08,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:49:08,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:49:08,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:49:08,315 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:49:08,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:49:08,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:49:08,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:49:08,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:49:08,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:49:08,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:49:08,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:49:08,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:49:08,321 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:49:08,321 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:49:08,322 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:49:08,322 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:49:08,322 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:49:08,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:49:08,323 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:49:08,323 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:49:08,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:49:08,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:49:08,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:49:08,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:49:08,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:49:08,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:49:08,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:49:08,327 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:49:08,328 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:49:08,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:49:08,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:49:08,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:49:08,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:49:08,329 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:49:08,330 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93e3c3bb67a4613ef517536c02b2baa8489f9a353eac0e6ca61ce50a9ad293d5 [2024-10-11 11:49:08,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:49:08,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:49:08,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:49:08,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:49:08,690 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:49:08,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i [2024-10-11 11:49:10,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:49:10,469 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:49:10,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-42.i [2024-10-11 11:49:10,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/10a45c8d1/bf18c1ccda7b477887040a859dc53e26/FLAG7559dac45 [2024-10-11 11:49:10,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/10a45c8d1/bf18c1ccda7b477887040a859dc53e26 [2024-10-11 11:49:10,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:49:10,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:49:10,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:49:10,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:49:10,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:49:10,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:49:10" (1/1) ... [2024-10-11 11:49:10,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b7e4c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:10, skipping insertion in model container [2024-10-11 11:49:10,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:49:10" (1/1) ... [2024-10-11 11:49:10,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:49:11,055 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_loopvsstraightlinecode_50-1loop_file-42.i[915,928] [2024-10-11 11:49:11,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:49:11,132 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:49:11,145 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_loopvsstraightlinecode_50-1loop_file-42.i[915,928] [2024-10-11 11:49:11,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:49:11,206 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:49:11,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:11 WrapperNode [2024-10-11 11:49:11,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:49:11,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:49:11,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:49:11,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:49:11,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:11" (1/1) ... [2024-10-11 11:49:11,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:11" (1/1) ... [2024-10-11 11:49:11,266 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-10-11 11:49:11,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:49:11,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:49:11,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:49:11,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:49:11,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:11" (1/1) ... [2024-10-11 11:49:11,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:11" (1/1) ... [2024-10-11 11:49:11,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:11" (1/1) ... [2024-10-11 11:49:11,309 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-11 11:49:11,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:11" (1/1) ... [2024-10-11 11:49:11,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:11" (1/1) ... [2024-10-11 11:49:11,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:11" (1/1) ... [2024-10-11 11:49:11,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:11" (1/1) ... [2024-10-11 11:49:11,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:11" (1/1) ... [2024-10-11 11:49:11,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:11" (1/1) ... [2024-10-11 11:49:11,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:49:11,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:49:11,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:49:11,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:49:11,362 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:11" (1/1) ... [2024-10-11 11:49:11,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:49:11,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:49:11,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:49:11,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:49:11,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:49:11,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:49:11,442 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:49:11,442 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:49:11,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:49:11,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:49:11,532 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:49:11,534 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:49:11,895 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-11 11:49:11,897 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:49:11,983 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:49:11,983 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:49:11,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:49:11 BoogieIcfgContainer [2024-10-11 11:49:11,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:49:11,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:49:11,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:49:11,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:49:11,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:49:10" (1/3) ... [2024-10-11 11:49:11,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4deee46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:49:11, skipping insertion in model container [2024-10-11 11:49:11,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:11" (2/3) ... [2024-10-11 11:49:11,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4deee46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:49:11, skipping insertion in model container [2024-10-11 11:49:11,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:49:11" (3/3) ... [2024-10-11 11:49:11,994 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-42.i [2024-10-11 11:49:12,010 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:49:12,011 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:49:12,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:49:12,091 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;@6e7519d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:49:12,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:49:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:49:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 11:49:12,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:12,107 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:49:12,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:12,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:12,113 INFO L85 PathProgramCache]: Analyzing trace with hash -594917490, now seen corresponding path program 1 times [2024-10-11 11:49:12,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:49:12,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249241499] [2024-10-11 11:49:12,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:12,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:49:12,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:49:12,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:49:12,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:49:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:12,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:49:12,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:49:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-11 11:49:12,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:49:12,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:49:12,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249241499] [2024-10-11 11:49:12,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249241499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:49:12,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:49:12,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:49:12,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882140267] [2024-10-11 11:49:12,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:49:12,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:49:12,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:49:12,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:49:12,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:49:12,481 INFO L87 Difference]: Start difference. First operand has 47 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:49:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:49:12,574 INFO L93 Difference]: Finished difference Result 93 states and 155 transitions. [2024-10-11 11:49:12,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:49:12,577 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2024-10-11 11:49:12,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:49:12,585 INFO L225 Difference]: With dead ends: 93 [2024-10-11 11:49:12,585 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 11:49:12,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:49:12,591 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:49:12,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:49:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 11:49:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 11:49:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:49:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2024-10-11 11:49:12,630 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 83 [2024-10-11 11:49:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:49:12,630 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-10-11 11:49:12,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:49:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2024-10-11 11:49:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 11:49:12,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:12,634 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:49:12,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:49:12,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:49:12,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:12,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:12,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1332087086, now seen corresponding path program 1 times [2024-10-11 11:49:12,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:49:12,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140510053] [2024-10-11 11:49:12,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:12,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:49:12,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:49:12,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:49:12,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:49:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:13,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 11:49:13,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:49:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:49:13,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:49:13,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:49:13,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140510053] [2024-10-11 11:49:13,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140510053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:49:13,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:49:13,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:49:13,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342222962] [2024-10-11 11:49:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:49:13,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:49:13,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:49:13,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:49:13,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:49:13,262 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:49:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:49:13,542 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2024-10-11 11:49:13,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:49:13,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-10-11 11:49:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:49:13,545 INFO L225 Difference]: With dead ends: 134 [2024-10-11 11:49:13,545 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 11:49:13,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-11 11:49:13,547 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 63 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:49:13,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 183 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:49:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 11:49:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2024-10-11 11:49:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 11:49:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 103 transitions. [2024-10-11 11:49:13,568 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 103 transitions. Word has length 83 [2024-10-11 11:49:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:49:13,568 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 103 transitions. [2024-10-11 11:49:13,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:49:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 103 transitions. [2024-10-11 11:49:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 11:49:13,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:13,572 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:49:13,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 11:49:13,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:49:13,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:13,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:13,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1817740538, now seen corresponding path program 1 times [2024-10-11 11:49:13,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:49:13,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602403851] [2024-10-11 11:49:13,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:13,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:49:13,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:49:13,778 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:49:13,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 11:49:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:13,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:49:13,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:49:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:49:14,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:49:14,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:49:14,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602403851] [2024-10-11 11:49:14,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602403851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:49:14,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:49:14,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:49:14,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136335565] [2024-10-11 11:49:14,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:49:14,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:49:14,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:49:14,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:49:14,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:49:14,367 INFO L87 Difference]: Start difference. First operand 70 states and 103 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:49:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:49:15,045 INFO L93 Difference]: Finished difference Result 201 states and 301 transitions. [2024-10-11 11:49:15,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:49:15,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-10-11 11:49:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:49:15,052 INFO L225 Difference]: With dead ends: 201 [2024-10-11 11:49:15,052 INFO L226 Difference]: Without dead ends: 157 [2024-10-11 11:49:15,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:49:15,054 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 92 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 11:49:15,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 273 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 11:49:15,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-11 11:49:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 112. [2024-10-11 11:49:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 72 states have internal predecessors, (95), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 11:49:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2024-10-11 11:49:15,083 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 167 transitions. Word has length 84 [2024-10-11 11:49:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:49:15,084 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 167 transitions. [2024-10-11 11:49:15,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:49:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 167 transitions. [2024-10-11 11:49:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 11:49:15,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:15,086 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:49:15,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 11:49:15,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:49:15,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:15,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:15,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1466109508, now seen corresponding path program 1 times [2024-10-11 11:49:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:49:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210909581] [2024-10-11 11:49:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:15,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:49:15,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:49:15,292 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:49:15,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 11:49:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:15,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:49:15,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:49:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:49:15,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:49:15,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:49:15,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210909581] [2024-10-11 11:49:15,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210909581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:49:15,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:49:15,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:49:15,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503438328] [2024-10-11 11:49:15,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:49:15,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:49:15,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:49:15,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:49:15,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:49:15,491 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:49:15,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:49:15,650 INFO L93 Difference]: Finished difference Result 198 states and 297 transitions. [2024-10-11 11:49:15,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:49:15,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-10-11 11:49:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:49:15,655 INFO L225 Difference]: With dead ends: 198 [2024-10-11 11:49:15,655 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 11:49:15,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:49:15,659 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:49:15,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:49:15,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 11:49:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 11:49:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 11:49:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 165 transitions. [2024-10-11 11:49:15,695 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 165 transitions. Word has length 84 [2024-10-11 11:49:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:49:15,695 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 165 transitions. [2024-10-11 11:49:15,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:49:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 165 transitions. [2024-10-11 11:49:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 11:49:15,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:15,700 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:49:15,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 11:49:15,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:49:15,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:15,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:15,905 INFO L85 PathProgramCache]: Analyzing trace with hash 656762882, now seen corresponding path program 1 times [2024-10-11 11:49:15,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:49:15,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163993628] [2024-10-11 11:49:15,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:15,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:49:15,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:49:15,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:49:15,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 11:49:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:16,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 11:49:16,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:49:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 11:49:16,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:49:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-10-11 11:49:16,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:49:16,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163993628] [2024-10-11 11:49:16,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163993628] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:49:16,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:49:16,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-11 11:49:16,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930194576] [2024-10-11 11:49:16,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:49:16,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 11:49:16,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:49:16,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 11:49:16,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-11 11:49:16,635 INFO L87 Difference]: Start difference. First operand 112 states and 165 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 11:49:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:49:17,570 INFO L93 Difference]: Finished difference Result 265 states and 356 transitions. [2024-10-11 11:49:17,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 11:49:17,571 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 84 [2024-10-11 11:49:17,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:49:17,572 INFO L225 Difference]: With dead ends: 265 [2024-10-11 11:49:17,572 INFO L226 Difference]: Without dead ends: 221 [2024-10-11 11:49:17,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 11:49:17,576 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 101 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 11:49:17,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 267 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 11:49:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-11 11:49:17,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 195. [2024-10-11 11:49:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 134 states have internal predecessors, (168), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 11:49:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2024-10-11 11:49:17,627 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 84 [2024-10-11 11:49:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:49:17,628 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2024-10-11 11:49:17,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 11:49:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2024-10-11 11:49:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 11:49:17,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:17,629 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:49:17,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 11:49:17,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:49:17,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:17,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:17,831 INFO L85 PathProgramCache]: Analyzing trace with hash 69956868, now seen corresponding path program 1 times [2024-10-11 11:49:17,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:49:17,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399156333] [2024-10-11 11:49:17,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:17,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:49:17,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:49:17,835 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:49:17,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 11:49:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:17,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 11:49:17,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:49:18,454 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-11 11:49:18,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:49:18,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:49:18,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399156333] [2024-10-11 11:49:18,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399156333] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:49:18,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1453393500] [2024-10-11 11:49:18,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:18,719 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 11:49:18,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 11:49:18,722 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 11:49:18,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-11 11:49:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:19,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 11:49:19,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:49:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:49:19,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:49:19,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1453393500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:49:19,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:49:19,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-10-11 11:49:19,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189297380] [2024-10-11 11:49:19,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:49:19,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:49:19,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:49:19,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:49:19,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 11:49:19,437 INFO L87 Difference]: Start difference. First operand 195 states and 264 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:49:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:49:20,959 INFO L93 Difference]: Finished difference Result 558 states and 751 transitions. [2024-10-11 11:49:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:49:20,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-10-11 11:49:20,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:49:20,966 INFO L225 Difference]: With dead ends: 558 [2024-10-11 11:49:20,966 INFO L226 Difference]: Without dead ends: 457 [2024-10-11 11:49:20,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-11 11:49:20,969 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 107 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:49:20,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 300 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 11:49:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-11 11:49:21,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 389. [2024-10-11 11:49:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 277 states have (on average 1.2671480144404332) internal successors, (351), 279 states have internal predecessors, (351), 88 states have call successors, (88), 23 states have call predecessors, (88), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 11:49:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 527 transitions. [2024-10-11 11:49:21,039 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 527 transitions. Word has length 84 [2024-10-11 11:49:21,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:49:21,040 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 527 transitions. [2024-10-11 11:49:21,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:49:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 527 transitions. [2024-10-11 11:49:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 11:49:21,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:21,043 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:49:21,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 11:49:21,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-10-11 11:49:21,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 11:49:21,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:21,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash 328122306, now seen corresponding path program 1 times [2024-10-11 11:49:21,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:49:21,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358839875] [2024-10-11 11:49:21,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:21,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:49:21,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:49:21,447 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:49:21,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 11:49:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:21,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 11:49:21,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:49:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-11 11:49:22,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:49:22,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:49:22,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358839875] [2024-10-11 11:49:22,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358839875] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:49:22,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1637450761] [2024-10-11 11:49:22,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:22,264 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 11:49:22,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 11:49:22,265 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 11:49:22,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-10-11 11:49:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:22,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 11:49:22,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:49:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:49:23,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:49:23,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1637450761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:49:23,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:49:23,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-11 11:49:23,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396664603] [2024-10-11 11:49:23,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:49:23,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:49:23,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:49:23,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:49:23,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-11 11:49:23,117 INFO L87 Difference]: Start difference. First operand 389 states and 527 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:49:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:49:24,247 INFO L93 Difference]: Finished difference Result 682 states and 924 transitions. [2024-10-11 11:49:24,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:49:24,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-10-11 11:49:24,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:49:24,254 INFO L225 Difference]: With dead ends: 682 [2024-10-11 11:49:24,256 INFO L226 Difference]: Without dead ends: 527 [2024-10-11 11:49:24,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-11 11:49:24,257 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 61 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:49:24,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 250 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 11:49:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-11 11:49:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 488. [2024-10-11 11:49:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 346 states have (on average 1.260115606936416) internal successors, (436), 348 states have internal predecessors, (436), 112 states have call successors, (112), 29 states have call predecessors, (112), 29 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-11 11:49:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 660 transitions. [2024-10-11 11:49:24,307 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 660 transitions. Word has length 84 [2024-10-11 11:49:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:49:24,307 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 660 transitions. [2024-10-11 11:49:24,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:49:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 660 transitions. [2024-10-11 11:49:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 11:49:24,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:24,309 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:49:24,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-10-11 11:49:24,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-11 11:49:24,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:49:24,710 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:24,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash -935442791, now seen corresponding path program 1 times [2024-10-11 11:49:24,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:49:24,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968609728] [2024-10-11 11:49:24,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:24,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:49:24,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:49:24,714 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:49:24,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 11:49:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:24,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 11:49:24,845 INFO L278 TraceCheckSpWp]: Computing forward predicates...