./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b8050949fc4d0670402251968fc516d02c3e8e6f315dd4678680d4b71ae7bee --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:40:32,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:40:32,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:40:32,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:40:32,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:40:32,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:40:32,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:40:32,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:40:32,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:40:32,175 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:40:32,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:40:32,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:40:32,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:40:32,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:40:32,178 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:40:32,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:40:32,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:40:32,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:40:32,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:40:32,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:40:32,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:40:32,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:40:32,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:40:32,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:40:32,184 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:40:32,185 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:40:32,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:40:32,185 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:40:32,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:40:32,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:40:32,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:40:32,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:40:32,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:40:32,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:40:32,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:40:32,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:40:32,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:40:32,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:40:32,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:40:32,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:40:32,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:40:32,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:40:32,188 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b8050949fc4d0670402251968fc516d02c3e8e6f315dd4678680d4b71ae7bee [2024-11-12 05:40:32,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:40:32,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:40:32,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:40:32,450 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:40:32,450 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:40:32,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-3.i [2024-11-12 05:40:33,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:40:34,126 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:40:34,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-3.i [2024-11-12 05:40:34,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc0b3cbf0/e747e59f2d794792a231d6cd2f4d9da9/FLAGb593ffb75 [2024-11-12 05:40:34,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc0b3cbf0/e747e59f2d794792a231d6cd2f4d9da9 [2024-11-12 05:40:34,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:40:34,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:40:34,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:40:34,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:40:34,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:40:34,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:40:34" (1/1) ... [2024-11-12 05:40:34,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c10c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34, skipping insertion in model container [2024-11-12 05:40:34,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:40:34" (1/1) ... [2024-11-12 05:40:34,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:40:34,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-3.i[914,927] [2024-11-12 05:40:34,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:40:34,753 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:40:34,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-3.i[914,927] [2024-11-12 05:40:34,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:40:34,801 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:40:34,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34 WrapperNode [2024-11-12 05:40:34,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:40:34,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:40:34,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:40:34,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:40:34,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34" (1/1) ... [2024-11-12 05:40:34,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34" (1/1) ... [2024-11-12 05:40:34,842 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-12 05:40:34,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:40:34,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:40:34,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:40:34,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:40:34,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34" (1/1) ... [2024-11-12 05:40:34,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34" (1/1) ... [2024-11-12 05:40:34,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34" (1/1) ... [2024-11-12 05:40:34,913 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:40:34,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34" (1/1) ... [2024-11-12 05:40:34,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34" (1/1) ... [2024-11-12 05:40:34,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34" (1/1) ... [2024-11-12 05:40:34,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34" (1/1) ... [2024-11-12 05:40:34,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34" (1/1) ... [2024-11-12 05:40:34,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34" (1/1) ... [2024-11-12 05:40:34,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:40:34,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:40:34,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:40:34,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:40:34,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34" (1/1) ... [2024-11-12 05:40:34,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:40:34,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:40:34,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:40:34,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:40:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:40:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:40:35,014 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:40:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:40:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:40:35,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:40:35,069 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:40:35,074 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:40:35,319 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-12 05:40:35,319 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:40:35,329 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:40:35,329 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:40:35,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:40:35 BoogieIcfgContainer [2024-11-12 05:40:35,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:40:35,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:40:35,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:40:35,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:40:35,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:40:34" (1/3) ... [2024-11-12 05:40:35,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e99e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:40:35, skipping insertion in model container [2024-11-12 05:40:35,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:34" (2/3) ... [2024-11-12 05:40:35,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e99e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:40:35, skipping insertion in model container [2024-11-12 05:40:35,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:40:35" (3/3) ... [2024-11-12 05:40:35,337 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-3.i [2024-11-12 05:40:35,350 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:40:35,350 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:40:35,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:40:35,403 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;@2d0c1f19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:40:35,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:40:35,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:40:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 05:40:35,415 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:40:35,415 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:40:35,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:40:35,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:40:35,421 INFO L85 PathProgramCache]: Analyzing trace with hash 141031647, now seen corresponding path program 1 times [2024-11-12 05:40:35,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:40:35,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252899103] [2024-11-12 05:40:35,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:40:35,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:40:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:40:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:40:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:40:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:40:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:40:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:40:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:40:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:40:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:40:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:40:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:40:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:40:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:40:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:40:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:40:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:40:35,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:40:35,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252899103] [2024-11-12 05:40:35,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252899103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:40:35,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:40:35,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:40:35,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494520869] [2024-11-12 05:40:35,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:40:35,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:40:35,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:40:35,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:40:35,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:40:35,761 INFO L87 Difference]: Start difference. First operand has 72 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:40:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:40:35,788 INFO L93 Difference]: Finished difference Result 141 states and 234 transitions. [2024-11-12 05:40:35,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:40:35,790 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 105 [2024-11-12 05:40:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:40:35,796 INFO L225 Difference]: With dead ends: 141 [2024-11-12 05:40:35,797 INFO L226 Difference]: Without dead ends: 68 [2024-11-12 05:40:35,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:40:35,804 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:40:35,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:40:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-12 05:40:35,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-12 05:40:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:40:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2024-11-12 05:40:35,874 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 105 [2024-11-12 05:40:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:40:35,874 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 103 transitions. [2024-11-12 05:40:35,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:40:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 103 transitions. [2024-11-12 05:40:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 05:40:35,879 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:40:35,879 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:40:35,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:40:35,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:40:35,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:40:35,909 INFO L85 PathProgramCache]: Analyzing trace with hash -520335455, now seen corresponding path program 1 times [2024-11-12 05:40:35,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:40:35,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891582039] [2024-11-12 05:40:35,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:40:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:40:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:40:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:40:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:40:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:40:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:40:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:40:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:40:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:40:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:40:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:40:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:40:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:40:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:40:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:40:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:40:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:40:36,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:40:36,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891582039] [2024-11-12 05:40:36,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891582039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:40:36,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:40:36,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:40:36,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208831295] [2024-11-12 05:40:36,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:40:36,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:40:36,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:40:36,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:40:36,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:40:36,310 INFO L87 Difference]: Start difference. First operand 68 states and 103 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:40:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:40:36,385 INFO L93 Difference]: Finished difference Result 198 states and 303 transitions. [2024-11-12 05:40:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:40:36,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-11-12 05:40:36,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:40:36,388 INFO L225 Difference]: With dead ends: 198 [2024-11-12 05:40:36,388 INFO L226 Difference]: Without dead ends: 133 [2024-11-12 05:40:36,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:40:36,389 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 62 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:40:36,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 181 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:40:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-12 05:40:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-12 05:40:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 05:40:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 198 transitions. [2024-11-12 05:40:36,424 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 198 transitions. Word has length 105 [2024-11-12 05:40:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:40:36,426 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 198 transitions. [2024-11-12 05:40:36,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:40:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 198 transitions. [2024-11-12 05:40:36,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-12 05:40:36,429 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:40:36,429 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:40:36,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:40:36,429 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:40:36,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:40:36,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1419654087, now seen corresponding path program 1 times [2024-11-12 05:40:36,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:40:36,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134144973] [2024-11-12 05:40:36,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:40:36,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:40:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:40:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:40:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:40:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:40:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:40:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:40:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:40:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:40:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:40:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:40:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:40:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:40:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:40:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:40:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:40:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:40:36,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:40:36,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134144973] [2024-11-12 05:40:36,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134144973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:40:36,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:40:36,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:40:36,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613530598] [2024-11-12 05:40:36,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:40:36,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:40:36,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:40:36,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:40:36,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:40:36,612 INFO L87 Difference]: Start difference. First operand 131 states and 198 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:40:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:40:36,720 INFO L93 Difference]: Finished difference Result 379 states and 578 transitions. [2024-11-12 05:40:36,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:40:36,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106 [2024-11-12 05:40:36,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:40:36,722 INFO L225 Difference]: With dead ends: 379 [2024-11-12 05:40:36,724 INFO L226 Difference]: Without dead ends: 251 [2024-11-12 05:40:36,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:40:36,728 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 87 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:40:36,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 260 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:40:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-12 05:40:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2024-11-12 05:40:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 184 states have (on average 1.391304347826087) internal successors, (256), 184 states have internal predecessors, (256), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 05:40:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 376 transitions. [2024-11-12 05:40:36,764 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 376 transitions. Word has length 106 [2024-11-12 05:40:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:40:36,765 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 376 transitions. [2024-11-12 05:40:36,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:40:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 376 transitions. [2024-11-12 05:40:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-12 05:40:36,769 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:40:36,769 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:40:36,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:40:36,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:40:36,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:40:36,770 INFO L85 PathProgramCache]: Analyzing trace with hash 384375073, now seen corresponding path program 1 times [2024-11-12 05:40:36,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:40:36,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010341482] [2024-11-12 05:40:36,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:40:36,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:40:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:40:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:40:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:40:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:40:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:40:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:40:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:40:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:40:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:40:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:40:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:40:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:40:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:40:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:40:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:40:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:40:36,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:40:36,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010341482] [2024-11-12 05:40:36,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010341482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:40:36,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:40:36,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:40:36,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567234454] [2024-11-12 05:40:36,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:40:36,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:40:36,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:40:36,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:40:36,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:40:36,889 INFO L87 Difference]: Start difference. First operand 249 states and 376 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:40:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:40:36,927 INFO L93 Difference]: Finished difference Result 617 states and 926 transitions. [2024-11-12 05:40:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:40:36,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106 [2024-11-12 05:40:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:40:36,937 INFO L225 Difference]: With dead ends: 617 [2024-11-12 05:40:36,937 INFO L226 Difference]: Without dead ends: 371 [2024-11-12 05:40:36,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:40:36,948 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 44 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:40:36,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 219 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:40:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-12 05:40:36,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 285. [2024-11-12 05:40:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 220 states have (on average 1.4) internal successors, (308), 220 states have internal predecessors, (308), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 05:40:36,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 428 transitions. [2024-11-12 05:40:36,999 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 428 transitions. Word has length 106 [2024-11-12 05:40:37,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:40:37,000 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 428 transitions. [2024-11-12 05:40:37,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:40:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 428 transitions. [2024-11-12 05:40:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-12 05:40:37,003 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:40:37,003 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:40:37,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:40:37,004 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:40:37,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:40:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash -800908025, now seen corresponding path program 1 times [2024-11-12 05:40:37,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:40:37,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909726938] [2024-11-12 05:40:37,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:40:37,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:40:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:40:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:40:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:40:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:40:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:40:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:40:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:40:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:40:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:40:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:40:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:40:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:40:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:40:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:40:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:40:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-12 05:40:37,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:40:37,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909726938] [2024-11-12 05:40:37,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909726938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:40:37,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:40:37,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 05:40:37,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814517871] [2024-11-12 05:40:37,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:40:37,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:40:37,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:40:37,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:40:37,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:40:37,895 INFO L87 Difference]: Start difference. First operand 285 states and 428 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:40:38,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:40:38,572 INFO L93 Difference]: Finished difference Result 871 states and 1262 transitions. [2024-11-12 05:40:38,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 05:40:38,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-11-12 05:40:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:40:38,576 INFO L225 Difference]: With dead ends: 871 [2024-11-12 05:40:38,576 INFO L226 Difference]: Without dead ends: 589 [2024-11-12 05:40:38,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-11-12 05:40:38,578 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 213 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 05:40:38,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 385 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 05:40:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-12 05:40:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 355. [2024-11-12 05:40:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 286 states have (on average 1.416083916083916) internal successors, (405), 286 states have internal predecessors, (405), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 05:40:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 525 transitions. [2024-11-12 05:40:38,607 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 525 transitions. Word has length 107 [2024-11-12 05:40:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:40:38,607 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 525 transitions. [2024-11-12 05:40:38,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:40:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 525 transitions. [2024-11-12 05:40:38,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-12 05:40:38,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:40:38,608 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:40:38,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 05:40:38,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:40:38,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:40:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1905711369, now seen corresponding path program 1 times [2024-11-12 05:40:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:40:38,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145842712] [2024-11-12 05:40:38,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:40:38,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:40:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:40:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:40:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:40:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:40:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:40:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:40:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:40:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:40:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:40:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:40:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:40:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:40:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:40:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:40:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:40:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:38,713 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:40:38,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:40:38,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145842712] [2024-11-12 05:40:38,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145842712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:40:38,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:40:38,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:40:38,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793040789] [2024-11-12 05:40:38,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:40:38,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:40:38,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:40:38,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:40:38,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:40:38,715 INFO L87 Difference]: Start difference. First operand 355 states and 525 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:40:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:40:38,783 INFO L93 Difference]: Finished difference Result 861 states and 1274 transitions. [2024-11-12 05:40:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:40:38,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-11-12 05:40:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:40:38,786 INFO L225 Difference]: With dead ends: 861 [2024-11-12 05:40:38,786 INFO L226 Difference]: Without dead ends: 509 [2024-11-12 05:40:38,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:40:38,787 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 63 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:40:38,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 212 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:40:38,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-12 05:40:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 507. [2024-11-12 05:40:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 404 states have (on average 1.4034653465346534) internal successors, (567), 404 states have internal predecessors, (567), 90 states have call successors, (90), 12 states have call predecessors, (90), 12 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-12 05:40:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 747 transitions. [2024-11-12 05:40:38,874 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 747 transitions. Word has length 107 [2024-11-12 05:40:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:40:38,875 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 747 transitions. [2024-11-12 05:40:38,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:40:38,875 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 747 transitions. [2024-11-12 05:40:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-12 05:40:38,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:40:38,876 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:40:38,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 05:40:38,880 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:40:38,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:40:38,881 INFO L85 PathProgramCache]: Analyzing trace with hash -280266831, now seen corresponding path program 1 times [2024-11-12 05:40:38,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:40:38,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738215663] [2024-11-12 05:40:38,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:40:38,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:40:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:40:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:40:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:40:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:40:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:40:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:40:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:40:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:40:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:40:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:40:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:40:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:40:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:40:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:40:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:40:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:40:39,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:40:39,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738215663] [2024-11-12 05:40:39,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738215663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:40:39,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:40:39,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 05:40:39,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374398888] [2024-11-12 05:40:39,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:40:39,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:40:39,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:40:39,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:40:39,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:40:39,135 INFO L87 Difference]: Start difference. First operand 507 states and 747 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:40:39,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:40:39,535 INFO L93 Difference]: Finished difference Result 1426 states and 2108 transitions. [2024-11-12 05:40:39,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:40:39,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 107 [2024-11-12 05:40:39,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:40:39,540 INFO L225 Difference]: With dead ends: 1426 [2024-11-12 05:40:39,540 INFO L226 Difference]: Without dead ends: 1173 [2024-11-12 05:40:39,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:40:39,542 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 303 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:40:39,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 477 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:40:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2024-11-12 05:40:39,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1157. [2024-11-12 05:40:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 918 states have (on average 1.4074074074074074) internal successors, (1292), 918 states have internal predecessors, (1292), 210 states have call successors, (210), 28 states have call predecessors, (210), 28 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-12 05:40:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1712 transitions. [2024-11-12 05:40:39,617 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1712 transitions. Word has length 107 [2024-11-12 05:40:39,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:40:39,617 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1712 transitions. [2024-11-12 05:40:39,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:40:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1712 transitions. [2024-11-12 05:40:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 05:40:39,619 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:40:39,619 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:40:39,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 05:40:39,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:40:39,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:40:39,620 INFO L85 PathProgramCache]: Analyzing trace with hash -813370198, now seen corresponding path program 1 times [2024-11-12 05:40:39,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:40:39,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706241177] [2024-11-12 05:40:39,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:40:39,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:40:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:40:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:40:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:40:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:40:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:40:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:40:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:40:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:40:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:40:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:40:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:40:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:40:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:40:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:40:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:40:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:40:39,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:40:39,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706241177] [2024-11-12 05:40:39,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706241177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:40:39,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:40:39,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 05:40:39,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866374816] [2024-11-12 05:40:39,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:40:39,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 05:40:39,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:40:39,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 05:40:39,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:40:39,904 INFO L87 Difference]: Start difference. First operand 1157 states and 1712 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:40:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:40:40,311 INFO L93 Difference]: Finished difference Result 2333 states and 3445 transitions. [2024-11-12 05:40:40,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 05:40:40,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2024-11-12 05:40:40,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:40:40,317 INFO L225 Difference]: With dead ends: 2333 [2024-11-12 05:40:40,317 INFO L226 Difference]: Without dead ends: 1179 [2024-11-12 05:40:40,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-12 05:40:40,320 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 373 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:40:40,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 471 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:40:40,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2024-11-12 05:40:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1159. [2024-11-12 05:40:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 920 states have (on average 1.4032608695652173) internal successors, (1291), 920 states have internal predecessors, (1291), 210 states have call successors, (210), 28 states have call predecessors, (210), 28 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-12 05:40:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1711 transitions. [2024-11-12 05:40:40,392 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1711 transitions. Word has length 108 [2024-11-12 05:40:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:40:40,392 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1711 transitions. [2024-11-12 05:40:40,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:40:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1711 transitions. [2024-11-12 05:40:40,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 05:40:40,393 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:40:40,393 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:40:40,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 05:40:40,394 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:40:40,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:40:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1479137652, now seen corresponding path program 1 times [2024-11-12 05:40:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:40:40,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297299736] [2024-11-12 05:40:40,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:40:40,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:40:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:40:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:40:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:40:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:40:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:40:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:40:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:40:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:40:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:40:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:40:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:40:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:40:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:40:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:40:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:40:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-12 05:40:40,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:40:40,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297299736] [2024-11-12 05:40:40,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297299736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:40:40,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108473333] [2024-11-12 05:40:40,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:40:40,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:40:40,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:40:40,912 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:40:40,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:40:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:41,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 05:40:41,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:40:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 295 proven. 51 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-12 05:40:41,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:40:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 111 proven. 39 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-11-12 05:40:43,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108473333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:40:43,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:40:43,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 15] total 35 [2024-11-12 05:40:43,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203636970] [2024-11-12 05:40:43,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:40:43,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-12 05:40:43,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:40:43,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-12 05:40:43,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=873, Unknown=0, NotChecked=0, Total=1190 [2024-11-12 05:40:43,104 INFO L87 Difference]: Start difference. First operand 1159 states and 1711 transitions. Second operand has 35 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (34), 12 states have call predecessors, (34), 10 states have call successors, (34) [2024-11-12 05:40:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:40:44,498 INFO L93 Difference]: Finished difference Result 2165 states and 3072 transitions. [2024-11-12 05:40:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-12 05:40:44,499 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (34), 12 states have call predecessors, (34), 10 states have call successors, (34) Word has length 108 [2024-11-12 05:40:44,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:40:44,504 INFO L225 Difference]: With dead ends: 2165 [2024-11-12 05:40:44,505 INFO L226 Difference]: Without dead ends: 1313 [2024-11-12 05:40:44,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1114, Invalid=2546, Unknown=0, NotChecked=0, Total=3660 [2024-11-12 05:40:44,508 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 919 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 05:40:44,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 509 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 05:40:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2024-11-12 05:40:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 533. [2024-11-12 05:40:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 412 states have (on average 1.3179611650485437) internal successors, (543), 412 states have internal predecessors, (543), 90 states have call successors, (90), 30 states have call predecessors, (90), 30 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-12 05:40:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 723 transitions. [2024-11-12 05:40:44,561 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 723 transitions. Word has length 108 [2024-11-12 05:40:44,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:40:44,562 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 723 transitions. [2024-11-12 05:40:44,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (34), 12 states have call predecessors, (34), 10 states have call successors, (34) [2024-11-12 05:40:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 723 transitions. [2024-11-12 05:40:44,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 05:40:44,563 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:40:44,563 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:40:44,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 05:40:44,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:40:44,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:40:44,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:40:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848931, now seen corresponding path program 1 times [2024-11-12 05:40:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:40:44,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649083953] [2024-11-12 05:40:44,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:40:44,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:40:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:40:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:40:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:40:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:40:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:40:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:40:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:40:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:40:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:40:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:40:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:40:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:40:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:40:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:40:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:40:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:40:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:40:44,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:40:44,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649083953] [2024-11-12 05:40:44,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649083953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:40:44,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:40:44,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:40:44,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552274272] [2024-11-12 05:40:44,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:40:44,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:40:44,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:40:44,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:40:44,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:40:44,995 INFO L87 Difference]: Start difference. First operand 533 states and 723 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:40:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:40:45,276 INFO L93 Difference]: Finished difference Result 1375 states and 1892 transitions. [2024-11-12 05:40:45,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:40:45,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-12 05:40:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:40:45,282 INFO L225 Difference]: With dead ends: 1375 [2024-11-12 05:40:45,282 INFO L226 Difference]: Without dead ends: 1107 [2024-11-12 05:40:45,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:40:45,284 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 180 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:40:45,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 371 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:40:45,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2024-11-12 05:40:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 965. [2024-11-12 05:40:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 764 states have (on average 1.3390052356020943) internal successors, (1023), 764 states have internal predecessors, (1023), 150 states have call successors, (150), 50 states have call predecessors, (150), 50 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-12 05:40:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1323 transitions. [2024-11-12 05:40:45,370 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1323 transitions. Word has length 108 [2024-11-12 05:40:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:40:45,370 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1323 transitions. [2024-11-12 05:40:45,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:40:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1323 transitions. [2024-11-12 05:40:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 05:40:45,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:40:45,371 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:40:45,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 05:40:45,372 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:40:45,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:40:45,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1305184124, now seen corresponding path program 1 times [2024-11-12 05:40:45,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:40:45,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827784857] [2024-11-12 05:40:45,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:40:45,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:40:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:40:45,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316444358] [2024-11-12 05:40:45,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:40:45,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:40:45,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:40:45,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:40:45,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 05:40:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:40:45,566 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:40:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:40:45,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:40:45,660 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:40:45,661 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:40:45,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 05:40:45,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-12 05:40:45,869 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:40:45,991 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:40:45,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:40:45 BoogieIcfgContainer [2024-11-12 05:40:45,993 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:40:45,994 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:40:45,994 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:40:45,994 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:40:45,994 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:40:35" (3/4) ... [2024-11-12 05:40:45,998 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:40:45,999 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:40:46,000 INFO L158 Benchmark]: Toolchain (without parser) took 11481.82ms. Allocated memory was 159.4MB in the beginning and 406.8MB in the end (delta: 247.5MB). Free memory was 87.3MB in the beginning and 351.9MB in the end (delta: -264.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:40:46,000 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:40:46,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.10ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 71.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 05:40:46,000 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.15ms. Allocated memory is still 159.4MB. Free memory was 71.8MB in the beginning and 68.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:40:46,001 INFO L158 Benchmark]: Boogie Preprocessor took 93.18ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 67.8MB in the beginning and 195.9MB in the end (delta: -128.0MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-11-12 05:40:46,001 INFO L158 Benchmark]: RCFGBuilder took 392.98ms. Allocated memory is still 226.5MB. Free memory was 195.9MB in the beginning and 171.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-12 05:40:46,001 INFO L158 Benchmark]: TraceAbstraction took 10661.64ms. Allocated memory was 226.5MB in the beginning and 406.8MB in the end (delta: 180.4MB). Free memory was 171.8MB in the beginning and 351.9MB in the end (delta: -180.1MB). Peak memory consumption was 195.3kB. Max. memory is 16.1GB. [2024-11-12 05:40:46,001 INFO L158 Benchmark]: Witness Printer took 5.92ms. Allocated memory is still 406.8MB. Free memory is still 351.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:40:46,003 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.19ms. Allocated memory is still 159.4MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.10ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 71.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.15ms. Allocated memory is still 159.4MB. Free memory was 71.8MB in the beginning and 68.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.18ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 67.8MB in the beginning and 195.9MB in the end (delta: -128.0MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * RCFGBuilder took 392.98ms. Allocated memory is still 226.5MB. Free memory was 195.9MB in the beginning and 171.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10661.64ms. Allocated memory was 226.5MB in the beginning and 406.8MB in the end (delta: 180.4MB). Free memory was 171.8MB in the beginning and 351.9MB in the end (delta: -180.1MB). Peak memory consumption was 195.3kB. Max. memory is 16.1GB. * Witness Printer took 5.92ms. Allocated memory is still 406.8MB. Free memory is still 351.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 someBinaryDOUBLEComparisonOperation at line 117, overapproximation of bitwiseOr at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int last_1_var_1_10 = 256; [L38] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256] [L121] isInitial = 1 [L122] FCALL initially() [L123] int k_loop; [L124] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256] [L124] COND TRUE k_loop < 1 [L125] CALL updateLastVariables() [L113] last_1_var_1_10 = var_1_10 [L114] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256] [L125] RET updateLastVariables() [L126] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L89] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L90] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L90] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L91] var_1_5 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L92] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L94] var_1_13 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L95] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L97] var_1_14 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L98] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L100] var_1_15 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L102] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L102] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L103] var_1_16 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L104] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L105] var_1_21 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L106] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L108] var_1_22 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L109] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L110] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L110] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L126] RET updateVariables() [L127] CALL step() [L42] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L47] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-8, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L48] COND TRUE stepLocal_2 > last_1_var_1_10 [L49] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L51] COND FALSE !((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L56] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L57] COND FALSE !(stepLocal_1 || var_1_3) [L62] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L64] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L75] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L80] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L80] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L81] COND TRUE var_1_20 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L82] COND FALSE !(var_1_12 == var_1_12) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L127] RET step() [L128] CALL, EXPR property() [L117] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L117-L118] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2250 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2244 mSDsluCounter, 3192 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2088 mSDsCounter, 573 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1630 IncrementalHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 573 mSolverCounterUnsat, 1104 mSDtfsCounter, 1630 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 640 GetRequests, 533 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1159occurred in iteration=8, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 1284 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1393 NumberOfCodeBlocks, 1393 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1271 ConstructedInterpolants, 0 QuantifiedInterpolants, 5337 SizeOfPredicates, 8 NumberOfNonLiveVariables, 257 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 4929/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:40:46,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b8050949fc4d0670402251968fc516d02c3e8e6f315dd4678680d4b71ae7bee --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:40:48,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:40:48,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:40:48,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:40:48,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:40:48,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:40:48,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:40:48,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:40:48,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:40:48,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:40:48,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:40:48,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:40:48,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:40:48,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:40:48,508 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:40:48,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:40:48,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:40:48,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:40:48,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:40:48,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:40:48,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:40:48,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:40:48,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:40:48,511 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:40:48,511 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:40:48,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:40:48,511 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:40:48,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:40:48,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:40:48,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:40:48,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:40:48,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:40:48,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:40:48,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:40:48,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:40:48,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:40:48,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:40:48,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:40:48,514 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:40:48,514 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:40:48,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:40:48,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:40:48,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:40:48,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:40:48,515 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b8050949fc4d0670402251968fc516d02c3e8e6f315dd4678680d4b71ae7bee [2024-11-12 05:40:48,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:40:48,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:40:48,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:40:48,806 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:40:48,807 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:40:48,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-3.i [2024-11-12 05:40:50,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:40:50,575 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:40:50,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-3.i [2024-11-12 05:40:50,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e7739bb/6001650b3f4349cbbdc656af838c89ca/FLAG5f14533e6 [2024-11-12 05:40:50,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e7739bb/6001650b3f4349cbbdc656af838c89ca [2024-11-12 05:40:50,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:40:50,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:40:50,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:40:50,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:40:50,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:40:50,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:40:50" (1/1) ... [2024-11-12 05:40:50,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e9362fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50, skipping insertion in model container [2024-11-12 05:40:50,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:40:50" (1/1) ... [2024-11-12 05:40:50,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:40:50,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-3.i[914,927] [2024-11-12 05:40:50,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:40:50,895 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:40:50,907 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-3.i[914,927] [2024-11-12 05:40:50,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:40:50,950 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:40:50,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50 WrapperNode [2024-11-12 05:40:50,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:40:50,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:40:50,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:40:50,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:40:50,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50" (1/1) ... [2024-11-12 05:40:50,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50" (1/1) ... [2024-11-12 05:40:50,993 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-11-12 05:40:50,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:40:50,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:40:50,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:40:50,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:40:51,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50" (1/1) ... [2024-11-12 05:40:51,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50" (1/1) ... [2024-11-12 05:40:51,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50" (1/1) ... [2024-11-12 05:40:51,032 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:40:51,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50" (1/1) ... [2024-11-12 05:40:51,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50" (1/1) ... [2024-11-12 05:40:51,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50" (1/1) ... [2024-11-12 05:40:51,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50" (1/1) ... [2024-11-12 05:40:51,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50" (1/1) ... [2024-11-12 05:40:51,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50" (1/1) ... [2024-11-12 05:40:51,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:40:51,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:40:51,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:40:51,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:40:51,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50" (1/1) ... [2024-11-12 05:40:51,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:40:51,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:40:51,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:40:51,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:40:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:40:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:40:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:40:51,130 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:40:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:40:51,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:40:51,215 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:40:51,217 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:41:06,305 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-12 05:41:06,305 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:41:06,315 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:41:06,315 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:41:06,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:41:06 BoogieIcfgContainer [2024-11-12 05:41:06,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:41:06,318 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:41:06,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:41:06,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:41:06,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:40:50" (1/3) ... [2024-11-12 05:41:06,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59af99d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:41:06, skipping insertion in model container [2024-11-12 05:41:06,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:40:50" (2/3) ... [2024-11-12 05:41:06,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59af99d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:41:06, skipping insertion in model container [2024-11-12 05:41:06,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:41:06" (3/3) ... [2024-11-12 05:41:06,323 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-3.i [2024-11-12 05:41:06,347 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:41:06,351 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:41:06,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:41:06,436 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;@18bab1ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:41:06,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:41:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:41:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 05:41:06,454 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:41:06,455 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:41:06,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:41:06,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:41:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1236545271, now seen corresponding path program 1 times [2024-11-12 05:41:06,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:41:06,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142587697] [2024-11-12 05:41:06,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:41:06,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:41:06,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:41:06,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:41:06,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:41:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:07,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 05:41:07,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:41:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:41:10,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:41:10,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:41:10,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142587697] [2024-11-12 05:41:10,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142587697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:41:10,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:41:10,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:41:10,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358504673] [2024-11-12 05:41:10,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:41:10,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:41:10,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:41:10,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:41:10,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:41:10,702 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:41:15,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:41:19,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:41:21,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:41:26,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:41:30,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:41:33,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:41:36,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:41:40,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:41:44,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:41:48,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:41:52,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:41:52,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:41:52,566 INFO L93 Difference]: Finished difference Result 177 states and 303 transitions. [2024-11-12 05:41:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:41:52,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-12 05:41:52,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:41:52,699 INFO L225 Difference]: With dead ends: 177 [2024-11-12 05:41:52,700 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 05:41:52,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:41:52,709 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 35 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.7s IncrementalHoareTripleChecker+Time [2024-11-12 05:41:52,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 264 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 8 Unknown, 0 Unchecked, 41.7s Time] [2024-11-12 05:41:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 05:41:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-11-12 05:41:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 05:41:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 163 transitions. [2024-11-12 05:41:52,770 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 163 transitions. Word has length 102 [2024-11-12 05:41:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:41:52,771 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 163 transitions. [2024-11-12 05:41:52,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:41:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 163 transitions. [2024-11-12 05:41:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 05:41:52,776 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:41:52,776 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:41:52,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 05:41:52,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:41:52,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:41:52,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:41:52,982 INFO L85 PathProgramCache]: Analyzing trace with hash -600548676, now seen corresponding path program 1 times [2024-11-12 05:41:52,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:41:52,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090820607] [2024-11-12 05:41:52,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:41:52,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:41:52,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:41:52,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:41:52,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:41:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:41:53,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 05:41:53,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:41:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:41:54,141 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:41:54,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:41:54,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090820607] [2024-11-12 05:41:54,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090820607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:41:54,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:41:54,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:41:54,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042436083] [2024-11-12 05:41:54,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:41:54,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:41:54,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:41:54,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:41:54,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:41:54,144 INFO L87 Difference]: Start difference. First operand 109 states and 163 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:41:58,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:42:02,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:42:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:42:02,862 INFO L93 Difference]: Finished difference Result 259 states and 386 transitions. [2024-11-12 05:42:02,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:42:02,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-12 05:42:02,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:42:02,866 INFO L225 Difference]: With dead ends: 259 [2024-11-12 05:42:02,867 INFO L226 Difference]: Without dead ends: 153 [2024-11-12 05:42:02,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:42:02,869 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 29 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-12 05:42:02,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 150 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-12 05:42:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-12 05:42:02,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2024-11-12 05:42:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 05:42:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 187 transitions. [2024-11-12 05:42:02,892 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 187 transitions. Word has length 103 [2024-11-12 05:42:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:42:02,893 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 187 transitions. [2024-11-12 05:42:02,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:42:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 187 transitions. [2024-11-12 05:42:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-12 05:42:02,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:42:02,895 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:42:02,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 05:42:03,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:42:03,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:42:03,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:42:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 32999376, now seen corresponding path program 1 times [2024-11-12 05:42:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:42:03,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983150981] [2024-11-12 05:42:03,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:42:03,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:42:03,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:42:03,112 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:42:03,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 05:42:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:42:04,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 05:42:04,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:42:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:42:06,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:42:06,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:42:06,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983150981] [2024-11-12 05:42:06,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983150981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:42:06,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:42:06,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:42:06,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191008243] [2024-11-12 05:42:06,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:42:06,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:42:06,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:42:06,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:42:06,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:42:06,964 INFO L87 Difference]: Start difference. First operand 127 states and 187 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:42:11,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:42:15,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []