./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_fillercode_fillercodestructure_filler-pr-ci_file-27.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 b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:25:38,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:25:38,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:25:38,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:25:38,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:25:38,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:25:38,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:25:38,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:25:38,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:25:38,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:25:38,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:25:38,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:25:38,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:25:38,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:25:38,423 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:25:38,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:25:38,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:25:38,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:25:38,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:25:38,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:25:38,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:25:38,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:25:38,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:25:38,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:25:38,430 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:25:38,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:25:38,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:25:38,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:25:38,431 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:25:38,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:25:38,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:25:38,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:25:38,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:25:38,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:25:38,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:25:38,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:25:38,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:25:38,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:25:38,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:25:38,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:25:38,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:25:38,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:25:38,437 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 -> b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d [2024-11-10 05:25:38,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:25:38,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:25:38,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:25:38,786 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:25:38,787 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:25:38,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-11-10 05:25:40,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:25:40,468 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:25:40,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-11-10 05:25:40,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aeae2651/5b867b3efa334ecaac1db5325c2f8a37/FLAG1ddf63e79 [2024-11-10 05:25:40,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aeae2651/5b867b3efa334ecaac1db5325c2f8a37 [2024-11-10 05:25:40,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:25:40,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:25:40,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:25:40,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:25:40,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:25:40,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:25:40" (1/1) ... [2024-11-10 05:25:40,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12788011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:40, skipping insertion in model container [2024-11-10 05:25:40,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:25:40" (1/1) ... [2024-11-10 05:25:40,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:25:41,021 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_fillercode_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2024-11-10 05:25:41,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:25:41,145 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:25:41,182 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_fillercode_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2024-11-10 05:25:41,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:25:41,254 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:25:41,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:41 WrapperNode [2024-11-10 05:25:41,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:25:41,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:25:41,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:25:41,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:25:41,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:41" (1/1) ... [2024-11-10 05:25:41,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:41" (1/1) ... [2024-11-10 05:25:41,328 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-10 05:25:41,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:25:41,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:25:41,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:25:41,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:25:41,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:41" (1/1) ... [2024-11-10 05:25:41,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:41" (1/1) ... [2024-11-10 05:25:41,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:41" (1/1) ... [2024-11-10 05:25:41,362 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-10 05:25:41,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:41" (1/1) ... [2024-11-10 05:25:41,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:41" (1/1) ... [2024-11-10 05:25:41,372 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:41" (1/1) ... [2024-11-10 05:25:41,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:41" (1/1) ... [2024-11-10 05:25:41,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:41" (1/1) ... [2024-11-10 05:25:41,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:41" (1/1) ... [2024-11-10 05:25:41,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:25:41,393 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:25:41,395 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:25:41,395 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:25:41,397 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:41" (1/1) ... [2024-11-10 05:25:41,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:25:41,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:25:41,440 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-10 05:25:41,444 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-10 05:25:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:25:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:25:41,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:25:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:25:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:25:41,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:25:41,636 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:25:41,639 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:25:42,075 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L177: havoc property_#t~bitwise19#1;havoc property_#t~short20#1; [2024-11-10 05:25:42,125 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 05:25:42,126 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:25:42,149 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:25:42,150 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 05:25:42,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:25:42 BoogieIcfgContainer [2024-11-10 05:25:42,150 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:25:42,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:25:42,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:25:42,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:25:42,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:25:40" (1/3) ... [2024-11-10 05:25:42,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db623d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:25:42, skipping insertion in model container [2024-11-10 05:25:42,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:41" (2/3) ... [2024-11-10 05:25:42,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db623d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:25:42, skipping insertion in model container [2024-11-10 05:25:42,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:25:42" (3/3) ... [2024-11-10 05:25:42,158 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-11-10 05:25:42,172 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:25:42,173 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:25:42,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:25:42,245 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;@720402a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:25:42,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:25:42,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 64 states have (on average 1.4375) internal successors, (92), 65 states have internal predecessors, (92), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 05:25:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 05:25:42,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:25:42,268 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:25:42,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:25:42,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:25:42,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1309934774, now seen corresponding path program 1 times [2024-11-10 05:25:42,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:25:42,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073158885] [2024-11-10 05:25:42,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:25:42,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:25:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:25:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:25:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:25:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:25:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:25:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 05:25:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:25:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:25:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:25:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:25:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:25:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:25:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:25:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:25:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:25:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:25:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:25:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:25:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:25:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:25:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:25:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:25:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:25:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:25:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:25:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:25:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 05:25:42,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:25:42,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073158885] [2024-11-10 05:25:42,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073158885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:25:42,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:25:42,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:25:42,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036827617] [2024-11-10 05:25:42,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:25:42,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:25:42,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:25:42,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:25:42,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:25:42,891 INFO L87 Difference]: Start difference. First operand has 93 states, 64 states have (on average 1.4375) internal successors, (92), 65 states have internal predecessors, (92), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 05:25:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:25:42,942 INFO L93 Difference]: Finished difference Result 177 states and 305 transitions. [2024-11-10 05:25:42,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:25:42,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2024-11-10 05:25:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:25:42,953 INFO L225 Difference]: With dead ends: 177 [2024-11-10 05:25:42,954 INFO L226 Difference]: Without dead ends: 87 [2024-11-10 05:25:42,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-10 05:25:42,965 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:25:42,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:25:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-10 05:25:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-10 05:25:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 05:25:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2024-11-10 05:25:43,013 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 173 [2024-11-10 05:25:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:25:43,014 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2024-11-10 05:25:43,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 05:25:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2024-11-10 05:25:43,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 05:25:43,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:25:43,018 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:25:43,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:25:43,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:25:43,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:25:43,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1345659004, now seen corresponding path program 1 times [2024-11-10 05:25:43,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:25:43,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874028581] [2024-11-10 05:25:43,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:25:43,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:25:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:25:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:25:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:25:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:25:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:25:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 05:25:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:25:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:25:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:25:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:25:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:25:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:25:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:25:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:25:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:25:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:25:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:25:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:25:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:25:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:25:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:25:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:25:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:25:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:25:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:25:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:25:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 05:25:43,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:25:43,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874028581] [2024-11-10 05:25:43,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874028581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:25:43,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:25:43,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:25:43,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743849063] [2024-11-10 05:25:43,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:25:43,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:25:43,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:25:43,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:25:43,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:25:43,657 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 05:25:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:25:43,771 INFO L93 Difference]: Finished difference Result 255 states and 393 transitions. [2024-11-10 05:25:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:25:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-10 05:25:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:25:43,776 INFO L225 Difference]: With dead ends: 255 [2024-11-10 05:25:43,777 INFO L226 Difference]: Without dead ends: 171 [2024-11-10 05:25:43,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:25:43,779 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 73 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:25:43,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 427 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:25:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-10 05:25:43,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166. [2024-11-10 05:25:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 05:25:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 255 transitions. [2024-11-10 05:25:43,824 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 255 transitions. Word has length 173 [2024-11-10 05:25:43,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:25:43,825 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 255 transitions. [2024-11-10 05:25:43,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 05:25:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 255 transitions. [2024-11-10 05:25:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 05:25:43,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:25:43,831 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:25:43,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:25:43,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:25:43,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:25:43,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1540988420, now seen corresponding path program 1 times [2024-11-10 05:25:43,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:25:43,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888517259] [2024-11-10 05:25:43,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:25:43,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:25:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:25:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:25:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:25:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:25:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:25:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 05:25:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:25:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:25:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:25:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:25:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:25:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:25:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:25:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:25:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:25:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:25:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:25:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:25:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:25:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:25:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:25:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:25:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:25:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:25:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:25:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:25:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 05:25:44,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:25:44,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888517259] [2024-11-10 05:25:44,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888517259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:25:44,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:25:44,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:25:44,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291144079] [2024-11-10 05:25:44,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:25:44,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:25:44,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:25:44,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:25:44,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:25:44,121 INFO L87 Difference]: Start difference. First operand 166 states and 255 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 05:25:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:25:44,223 INFO L93 Difference]: Finished difference Result 351 states and 520 transitions. [2024-11-10 05:25:44,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:25:44,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-10 05:25:44,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:25:44,228 INFO L225 Difference]: With dead ends: 351 [2024-11-10 05:25:44,231 INFO L226 Difference]: Without dead ends: 267 [2024-11-10 05:25:44,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:25:44,233 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 140 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:25:44,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 433 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:25:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-10 05:25:44,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 215. [2024-11-10 05:25:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 156 states have internal predecessors, (210), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 05:25:44,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 322 transitions. [2024-11-10 05:25:44,284 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 322 transitions. Word has length 174 [2024-11-10 05:25:44,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:25:44,287 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 322 transitions. [2024-11-10 05:25:44,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 05:25:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 322 transitions. [2024-11-10 05:25:44,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 05:25:44,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:25:44,290 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:25:44,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:25:44,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:25:44,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:25:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash 217078822, now seen corresponding path program 1 times [2024-11-10 05:25:44,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:25:44,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124042973] [2024-11-10 05:25:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:25:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:25:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:25:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:25:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:25:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:25:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:25:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 05:25:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:25:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:25:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:25:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:25:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:25:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:25:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:25:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:25:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:25:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:25:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:25:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:25:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:25:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:25:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:25:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:25:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:25:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:25:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:25:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:25:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 05:25:44,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:25:44,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124042973] [2024-11-10 05:25:44,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124042973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:25:44,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:25:44,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:25:44,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812321179] [2024-11-10 05:25:44,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:25:44,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:25:44,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:25:44,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:25:44,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:25:44,681 INFO L87 Difference]: Start difference. First operand 215 states and 322 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 05:25:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:25:44,864 INFO L93 Difference]: Finished difference Result 625 states and 929 transitions. [2024-11-10 05:25:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:25:44,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-10 05:25:44,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:25:44,873 INFO L225 Difference]: With dead ends: 625 [2024-11-10 05:25:44,873 INFO L226 Difference]: Without dead ends: 413 [2024-11-10 05:25:44,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:25:44,878 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 173 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:25:44,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 464 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:25:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-10 05:25:44,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 406. [2024-11-10 05:25:44,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 294 states have (on average 1.3401360544217686) internal successors, (394), 300 states have internal predecessors, (394), 102 states have call successors, (102), 9 states have call predecessors, (102), 9 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-10 05:25:44,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 598 transitions. [2024-11-10 05:25:44,928 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 598 transitions. Word has length 174 [2024-11-10 05:25:44,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:25:44,929 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 598 transitions. [2024-11-10 05:25:44,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 05:25:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 598 transitions. [2024-11-10 05:25:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 05:25:44,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:25:44,933 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:25:44,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:25:44,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:25:44,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:25:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1820977467, now seen corresponding path program 1 times [2024-11-10 05:25:44,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:25:44,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293209881] [2024-11-10 05:25:44,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:25:44,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:25:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:25:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:25:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:25:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:25:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:25:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 05:25:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:25:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:25:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:25:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:25:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:25:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:25:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:25:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:25:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:25:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:25:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:25:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:25:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:25:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:25:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:25:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:25:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:25:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:25:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:25:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:25:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 05:25:45,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:25:45,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293209881] [2024-11-10 05:25:45,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293209881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:25:45,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:25:45,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:25:45,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119995256] [2024-11-10 05:25:45,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:25:45,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:25:45,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:25:45,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:25:45,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:25:45,373 INFO L87 Difference]: Start difference. First operand 406 states and 598 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 05:25:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:25:45,703 INFO L93 Difference]: Finished difference Result 921 states and 1350 transitions. [2024-11-10 05:25:45,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:25:45,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-10 05:25:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:25:45,708 INFO L225 Difference]: With dead ends: 921 [2024-11-10 05:25:45,709 INFO L226 Difference]: Without dead ends: 709 [2024-11-10 05:25:45,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:25:45,711 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 127 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:25:45,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 522 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:25:45,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-11-10 05:25:45,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 481. [2024-11-10 05:25:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 369 states have (on average 1.4092140921409213) internal successors, (520), 375 states have internal predecessors, (520), 102 states have call successors, (102), 9 states have call predecessors, (102), 9 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-10 05:25:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 724 transitions. [2024-11-10 05:25:45,784 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 724 transitions. Word has length 174 [2024-11-10 05:25:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:25:45,785 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 724 transitions. [2024-11-10 05:25:45,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 05:25:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 724 transitions. [2024-11-10 05:25:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 05:25:45,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:25:45,788 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:25:45,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 05:25:45,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:25:45,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:25:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1887984220, now seen corresponding path program 1 times [2024-11-10 05:25:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:25:45,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723011828] [2024-11-10 05:25:45,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:25:45,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:25:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:25:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:25:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:25:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:25:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:25:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 05:25:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:25:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:25:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:25:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:25:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:25:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:25:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:25:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:25:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:25:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:25:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:25:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:25:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:25:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:25:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:25:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:25:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:25:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:25:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:25:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:25:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 05:25:46,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:25:46,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723011828] [2024-11-10 05:25:46,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723011828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:25:46,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:25:46,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:25:46,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194621546] [2024-11-10 05:25:46,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:25:46,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:25:46,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:25:46,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:25:46,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:25:46,205 INFO L87 Difference]: Start difference. First operand 481 states and 724 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 05:25:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:25:46,679 INFO L93 Difference]: Finished difference Result 1258 states and 1881 transitions. [2024-11-10 05:25:46,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:25:46,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-10 05:25:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:25:46,685 INFO L225 Difference]: With dead ends: 1258 [2024-11-10 05:25:46,685 INFO L226 Difference]: Without dead ends: 838 [2024-11-10 05:25:46,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:25:46,687 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 156 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:25:46,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 521 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 05:25:46,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-10 05:25:46,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 833. [2024-11-10 05:25:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 637 states have (on average 1.3830455259026688) internal successors, (881), 649 states have internal predecessors, (881), 178 states have call successors, (178), 17 states have call predecessors, (178), 17 states have return successors, (178), 166 states have call predecessors, (178), 178 states have call successors, (178) [2024-11-10 05:25:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1237 transitions. [2024-11-10 05:25:46,772 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1237 transitions. Word has length 174 [2024-11-10 05:25:46,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:25:46,773 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1237 transitions. [2024-11-10 05:25:46,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 05:25:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1237 transitions. [2024-11-10 05:25:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 05:25:46,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:25:46,776 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:25:46,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 05:25:46,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:25:46,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:25:46,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1874557648, now seen corresponding path program 1 times [2024-11-10 05:25:46,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:25:46,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600061871] [2024-11-10 05:25:46,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:25:46,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:25:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:25:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:25:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:25:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:25:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:25:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 05:25:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:25:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:25:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 05:25:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:25:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 05:25:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:25:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 05:25:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:25:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 05:25:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:25:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 05:25:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:25:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 05:25:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:25:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 05:25:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:25:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:25:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:25:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:25:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 05:25:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 90 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2024-11-10 05:25:47,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:25:47,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600061871] [2024-11-10 05:25:47,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600061871] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:25:47,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913993608] [2024-11-10 05:25:47,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:25:47,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:25:47,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:25:47,743 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-10 05:25:47,744 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-10 05:25:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:47,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 05:25:47,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:25:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 788 proven. 90 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2024-11-10 05:25:48,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:25:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 99 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2024-11-10 05:25:49,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913993608] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:25:49,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:25:49,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 21 [2024-11-10 05:25:49,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421214095] [2024-11-10 05:25:49,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:25:49,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 05:25:49,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:25:49,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 05:25:49,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2024-11-10 05:25:49,270 INFO L87 Difference]: Start difference. First operand 833 states and 1237 transitions. Second operand has 21 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-10 05:25:50,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:25:50,656 INFO L93 Difference]: Finished difference Result 1555 states and 2238 transitions. [2024-11-10 05:25:50,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-10 05:25:50,657 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 175 [2024-11-10 05:25:50,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:25:50,665 INFO L225 Difference]: With dead ends: 1555 [2024-11-10 05:25:50,665 INFO L226 Difference]: Without dead ends: 1161 [2024-11-10 05:25:50,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 394 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=613, Invalid=1643, Unknown=0, NotChecked=0, Total=2256 [2024-11-10 05:25:50,669 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 347 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 05:25:50,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 623 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 05:25:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-11-10 05:25:50,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 720. [2024-11-10 05:25:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 554 states have (on average 1.3501805054151625) internal successors, (748), 563 states have internal predecessors, (748), 140 states have call successors, (140), 25 states have call predecessors, (140), 25 states have return successors, (140), 131 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-10 05:25:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1028 transitions. [2024-11-10 05:25:50,787 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1028 transitions. Word has length 175 [2024-11-10 05:25:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:25:50,788 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1028 transitions. [2024-11-10 05:25:50,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-10 05:25:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1028 transitions. [2024-11-10 05:25:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 05:25:50,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:25:50,791 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:25:50,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 05:25:50,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:25:50,993 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:25:50,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:25:50,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2022221397, now seen corresponding path program 1 times [2024-11-10 05:25:50,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:25:50,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868152146] [2024-11-10 05:25:50,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:25:50,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:25:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:25:51,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1130174582] [2024-11-10 05:25:51,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:25:51,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:25:51,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:25:51,111 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-10 05:25:51,113 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-10 05:25:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:25:51,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 05:25:51,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:25:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-10 05:25:52,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:25:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 05:25:52,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:25:52,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868152146] [2024-11-10 05:25:52,661 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 05:25:52,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130174582] [2024-11-10 05:25:52,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130174582] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:25:52,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:25:52,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 18 [2024-11-10 05:25:52,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505879912] [2024-11-10 05:25:52,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:25:52,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 05:25:52,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:25:52,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 05:25:52,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-11-10 05:25:52,664 INFO L87 Difference]: Start difference. First operand 720 states and 1028 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 5 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) [2024-11-10 05:25:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:25:54,831 INFO L93 Difference]: Finished difference Result 2069 states and 2857 transitions. [2024-11-10 05:25:54,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-10 05:25:54,832 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 5 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) Word has length 175 [2024-11-10 05:25:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:25:54,840 INFO L225 Difference]: With dead ends: 2069 [2024-11-10 05:25:54,840 INFO L226 Difference]: Without dead ends: 1476 [2024-11-10 05:25:54,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=367, Invalid=823, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 05:25:54,844 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 580 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 05:25:54,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 957 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 05:25:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2024-11-10 05:25:55,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1249. [2024-11-10 05:25:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 925 states have (on average 1.28) internal successors, (1184), 945 states have internal predecessors, (1184), 264 states have call successors, (264), 59 states have call predecessors, (264), 59 states have return successors, (264), 244 states have call predecessors, (264), 264 states have call successors, (264) [2024-11-10 05:25:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1712 transitions. [2024-11-10 05:25:55,047 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1712 transitions. Word has length 175 [2024-11-10 05:25:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:25:55,048 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1712 transitions. [2024-11-10 05:25:55,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 5 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) [2024-11-10 05:25:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1712 transitions. [2024-11-10 05:25:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 05:25:55,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:25:55,051 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:25:55,070 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-10 05:25:55,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-10 05:25:55,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:25:55,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:25:55,257 INFO L85 PathProgramCache]: Analyzing trace with hash 948836301, now seen corresponding path program 1 times [2024-11-10 05:25:55,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:25:55,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216701652] [2024-11-10 05:25:55,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:25:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:25:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:25:55,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1110454619] [2024-11-10 05:25:55,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:25:55,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:25:55,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:25:55,386 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:25:55,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 05:25:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:25:55,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 05:25:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:25:55,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 05:25:55,881 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 05:25:55,883 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 05:25:55,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 05:25:56,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:25:56,095 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:25:56,239 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 05:25:56,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:25:56 BoogieIcfgContainer [2024-11-10 05:25:56,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 05:25:56,247 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 05:25:56,247 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 05:25:56,247 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 05:25:56,247 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:25:42" (3/4) ... [2024-11-10 05:25:56,250 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 05:25:56,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 05:25:56,251 INFO L158 Benchmark]: Toolchain (without parser) took 15443.40ms. Allocated memory was 144.7MB in the beginning and 346.0MB in the end (delta: 201.3MB). Free memory was 69.1MB in the beginning and 190.6MB in the end (delta: -121.5MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-11-10 05:25:56,251 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:25:56,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.67ms. Allocated memory is still 144.7MB. Free memory was 68.8MB in the beginning and 112.7MB in the end (delta: -43.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-11-10 05:25:56,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.59ms. Allocated memory is still 144.7MB. Free memory was 112.7MB in the beginning and 108.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 05:25:56,252 INFO L158 Benchmark]: Boogie Preprocessor took 61.26ms. Allocated memory is still 144.7MB. Free memory was 108.5MB in the beginning and 104.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 05:25:56,253 INFO L158 Benchmark]: IcfgBuilder took 757.28ms. Allocated memory is still 144.7MB. Free memory was 104.3MB in the beginning and 92.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-10 05:25:56,253 INFO L158 Benchmark]: TraceAbstraction took 14093.54ms. Allocated memory was 144.7MB in the beginning and 346.0MB in the end (delta: 201.3MB). Free memory was 92.1MB in the beginning and 190.6MB in the end (delta: -98.6MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. [2024-11-10 05:25:56,253 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 346.0MB. Free memory is still 190.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:25:56,255 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.20ms. Allocated memory is still 144.7MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.67ms. Allocated memory is still 144.7MB. Free memory was 68.8MB in the beginning and 112.7MB in the end (delta: -43.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.59ms. Allocated memory is still 144.7MB. Free memory was 112.7MB in the beginning and 108.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.26ms. Allocated memory is still 144.7MB. Free memory was 108.5MB in the beginning and 104.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 757.28ms. Allocated memory is still 144.7MB. Free memory was 104.3MB in the beginning and 92.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14093.54ms. Allocated memory was 144.7MB in the beginning and 346.0MB in the end (delta: 201.3MB). Free memory was 92.1MB in the beginning and 190.6MB in the end (delta: -98.6MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 346.0MB. Free memory is still 190.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of shiftRight at line 67, overapproximation of someBinaryArithmeticFLOAToperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L42] signed short int var_1_23 = 128; [L43] unsigned short int var_1_25 = 32; [L44] unsigned char var_1_29 = 1; [L45] unsigned long int var_1_31 = 0; [L46] unsigned char var_1_32 = 1; [L47] unsigned short int var_1_33 = 1000; [L48] signed char var_1_38 = 25; [L49] unsigned short int var_1_39 = 200; [L50] unsigned char var_1_43 = 10; [L51] unsigned char var_1_47 = 0; VAL [isInitial=0, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=0, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] FCALL updateLastVariables() [L185] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L136] var_1_3 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L139] var_1_4 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L140] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L141] var_1_5 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L142] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L143] var_1_6 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L144] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L145] var_1_7 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L146] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L151] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L154] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L156] var_1_16 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L157] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L159] var_1_17 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L160] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L162] var_1_19 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L163] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L165] var_1_33 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L166] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] CALL assume_abort_if_not(var_1_33 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] RET assume_abort_if_not(var_1_33 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L169] var_1_39 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L170] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_39 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] RET assume_abort_if_not(var_1_39 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_39 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] RET assume_abort_if_not(var_1_39 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L56] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L58] var_1_47 = var_1_11 [L59] var_1_20 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=-4294967280, var_1_8=1] [L60] COND TRUE var_1_11 >= var_1_21 [L61] var_1_31 = ((((var_1_21) > (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))))) ? (var_1_21) : (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=-4294967280, var_1_8=1] [L63] COND TRUE ((((var_1_21) < (var_1_33)) ? (var_1_21) : (var_1_33))) < (var_1_39 + var_1_11) [L64] var_1_43 = ((((var_1_11) < ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) ? (var_1_11) : ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L66] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L67] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L67] COND FALSE !((var_1_21 + var_1_12) > (2u >> var_1_11)) [L74] COND FALSE !(var_1_11 < var_1_11) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L79] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L90] unsigned char stepLocal_1 = var_1_14; [L91] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L92] COND TRUE var_1_14 || stepLocal_0 VAL [isInitial=1, stepLocal_1=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L93] COND TRUE stepLocal_1 || var_1_14 [L94] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L101] COND FALSE !(var_1_6 > (- var_1_7)) [L106] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] [L108] var_1_22 = var_1_8 [L109] var_1_23 = var_1_12 [L110] var_1_29 = var_1_19 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] [L111] COND FALSE !(var_1_12 < (~ (var_1_12 / var_1_33))) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] [L120] COND FALSE !(var_1_12 < (var_1_12 / var_1_33)) [L123] var_1_32 = ((! var_1_19) && var_1_15) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] [L126] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] [L177-L178] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] [L19] reach_error() VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=-255, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=-65534, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 9, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1650 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1596 mSDsluCounter, 4078 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2773 mSDsCounter, 629 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2137 IncrementalHoareTripleChecker+Invalid, 2766 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 629 mSolverCounterUnsat, 1305 mSDtfsCounter, 2137 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1179 GetRequests, 1077 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1249occurred in iteration=8, InterpolantAutomatonStates: 96, 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, 8 MinimizatonAttempts, 965 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2092 NumberOfCodeBlocks, 2092 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1906 ConstructedInterpolants, 0 QuantifiedInterpolants, 6433 SizeOfPredicates, 13 NumberOfNonLiveVariables, 797 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 13958/14300 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-10 05:25:56,320 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_fillercode_fillercodestructure_filler-pr-ci_file-27.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 b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:25:58,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:25:58,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 05:25:58,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:25:58,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:25:58,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:25:58,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:25:58,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:25:58,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:25:58,835 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:25:58,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:25:58,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:25:58,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:25:58,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:25:58,837 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:25:58,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:25:58,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:25:58,838 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:25:58,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:25:58,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:25:58,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:25:58,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:25:58,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:25:58,846 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 05:25:58,846 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 05:25:58,847 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:25:58,847 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 05:25:58,848 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:25:58,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:25:58,848 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:25:58,849 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:25:58,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:25:58,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:25:58,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:25:58,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:25:58,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:25:58,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:25:58,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:25:58,852 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 05:25:58,852 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 05:25:58,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:25:58,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:25:58,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:25:58,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:25:58,853 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 -> b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d [2024-11-10 05:25:59,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:25:59,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:25:59,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:25:59,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:25:59,248 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:25:59,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-11-10 05:26:00,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:26:01,080 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:26:01,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-11-10 05:26:01,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a9b30b78/69b24f3e6b19444bbc9fef54b7d2bc40/FLAG080e083c7 [2024-11-10 05:26:01,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a9b30b78/69b24f3e6b19444bbc9fef54b7d2bc40 [2024-11-10 05:26:01,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:26:01,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:26:01,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:26:01,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:26:01,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:26:01,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:26:01" (1/1) ... [2024-11-10 05:26:01,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b740d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01, skipping insertion in model container [2024-11-10 05:26:01,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:26:01" (1/1) ... [2024-11-10 05:26:01,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:26:01,675 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_fillercode_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2024-11-10 05:26:01,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:26:01,801 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:26:01,816 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_fillercode_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2024-11-10 05:26:01,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:26:01,900 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:26:01,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01 WrapperNode [2024-11-10 05:26:01,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:26:01,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:26:01,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:26:01,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:26:01,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01" (1/1) ... [2024-11-10 05:26:01,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01" (1/1) ... [2024-11-10 05:26:01,973 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-11-10 05:26:01,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:26:01,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:26:01,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:26:01,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:26:01,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01" (1/1) ... [2024-11-10 05:26:01,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01" (1/1) ... [2024-11-10 05:26:01,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01" (1/1) ... [2024-11-10 05:26:02,022 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-10 05:26:02,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01" (1/1) ... [2024-11-10 05:26:02,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01" (1/1) ... [2024-11-10 05:26:02,039 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01" (1/1) ... [2024-11-10 05:26:02,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01" (1/1) ... [2024-11-10 05:26:02,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01" (1/1) ... [2024-11-10 05:26:02,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01" (1/1) ... [2024-11-10 05:26:02,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:26:02,062 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:26:02,062 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:26:02,062 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:26:02,064 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01" (1/1) ... [2024-11-10 05:26:02,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:26:02,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:26:02,099 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-10 05:26:02,106 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-10 05:26:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:26:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 05:26:02,156 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:26:02,156 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:26:02,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:26:02,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:26:02,260 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:26:02,263 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:26:09,450 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 05:26:09,450 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:26:09,468 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:26:09,468 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:26:09,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:26:09 BoogieIcfgContainer [2024-11-10 05:26:09,469 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:26:09,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:26:09,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:26:09,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:26:09,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:26:01" (1/3) ... [2024-11-10 05:26:09,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484dc2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:26:09, skipping insertion in model container [2024-11-10 05:26:09,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:26:01" (2/3) ... [2024-11-10 05:26:09,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484dc2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:26:09, skipping insertion in model container [2024-11-10 05:26:09,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:26:09" (3/3) ... [2024-11-10 05:26:09,480 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-11-10 05:26:09,500 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:26:09,501 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:26:09,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:26:09,581 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;@3f996979, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:26:09,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:26:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 05:26:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 05:26:09,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:26:09,599 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:26:09,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:26:09,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:26:09,605 INFO L85 PathProgramCache]: Analyzing trace with hash 518570744, now seen corresponding path program 1 times [2024-11-10 05:26:09,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:26:09,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126339742] [2024-11-10 05:26:09,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:26:09,617 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-10 05:26:09,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:26:09,620 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-10 05:26:09,621 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-10 05:26:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:26:10,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 05:26:10,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:26:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-10 05:26:10,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:26:10,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:26:10,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126339742] [2024-11-10 05:26:10,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126339742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:26:10,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:26:10,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:26:10,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094429178] [2024-11-10 05:26:10,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:26:10,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:26:10,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:26:10,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:26:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:26:10,215 INFO L87 Difference]: Start difference. First operand has 86 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 05:26:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:26:10,248 INFO L93 Difference]: Finished difference Result 161 states and 281 transitions. [2024-11-10 05:26:10,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:26:10,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2024-11-10 05:26:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:26:10,257 INFO L225 Difference]: With dead ends: 161 [2024-11-10 05:26:10,257 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 05:26:10,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-10 05:26:10,264 INFO L432 NwaCegarLoop]: 116 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, 116 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-10 05:26:10,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:26:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 05:26:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-10 05:26:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 05:26:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2024-11-10 05:26:10,318 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 170 [2024-11-10 05:26:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:26:10,319 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2024-11-10 05:26:10,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 05:26:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2024-11-10 05:26:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 05:26:10,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:26:10,323 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:26:10,336 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-10 05:26:10,524 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-10 05:26:10,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:26:10,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:26:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash 735611796, now seen corresponding path program 1 times [2024-11-10 05:26:10,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:26:10,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064977757] [2024-11-10 05:26:10,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:26:10,527 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-10 05:26:10,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:26:10,530 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-10 05:26:10,531 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-10 05:26:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:26:11,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 05:26:11,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:26:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 619 proven. 48 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2024-11-10 05:26:12,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:26:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 05:26:12,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:26:12,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064977757] [2024-11-10 05:26:12,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064977757] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 05:26:12,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 05:26:12,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-10 05:26:12,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106472712] [2024-11-10 05:26:12,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:26:12,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:26:12,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:26:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:26:12,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:26:12,493 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 05:26:13,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:26:16,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:26:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:26:16,673 INFO L93 Difference]: Finished difference Result 157 states and 232 transitions. [2024-11-10 05:26:16,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:26:16,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-10 05:26:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:26:16,710 INFO L225 Difference]: With dead ends: 157 [2024-11-10 05:26:16,710 INFO L226 Difference]: Without dead ends: 82 [2024-11-10 05:26:16,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:26:16,713 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 61 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:26:16,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 150 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-10 05:26:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-10 05:26:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-10 05:26:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 05:26:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-11-10 05:26:16,734 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 170 [2024-11-10 05:26:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:26:16,735 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-11-10 05:26:16,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 05:26:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-10 05:26:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 05:26:16,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:26:16,738 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:26:16,758 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 (3)] Ended with exit code 0 [2024-11-10 05:26:16,938 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-10 05:26:16,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:26:16,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:26:16,940 INFO L85 PathProgramCache]: Analyzing trace with hash -835005353, now seen corresponding path program 1 times [2024-11-10 05:26:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:26:16,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525026582] [2024-11-10 05:26:16,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:26:16,941 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-10 05:26:16,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:26:16,943 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-10 05:26:16,946 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-10 05:26:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:26:17,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 05:26:17,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:26:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 05:26:18,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:26:18,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:26:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525026582] [2024-11-10 05:26:18,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525026582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:26:18,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:26:18,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:26:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745563367] [2024-11-10 05:26:18,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:26:18,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:26:18,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:26:18,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:26:18,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:26:18,404 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 05:26:20,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:26:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:26:20,853 INFO L93 Difference]: Finished difference Result 240 states and 348 transitions. [2024-11-10 05:26:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:26:20,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-10 05:26:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:26:20,886 INFO L225 Difference]: With dead ends: 240 [2024-11-10 05:26:20,886 INFO L226 Difference]: Without dead ends: 161 [2024-11-10 05:26:20,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 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-10 05:26:20,889 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 25 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:26:20,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 231 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 05:26:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-10 05:26:20,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2024-11-10 05:26:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 99 states have internal predecessors, (121), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 05:26:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 225 transitions. [2024-11-10 05:26:20,932 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 225 transitions. Word has length 171 [2024-11-10 05:26:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:26:20,933 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 225 transitions. [2024-11-10 05:26:20,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 05:26:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 225 transitions. [2024-11-10 05:26:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 05:26:20,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:26:20,941 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:26:20,962 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 (4)] Ended with exit code 0 [2024-11-10 05:26:21,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:26:21,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:26:21,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:26:21,144 INFO L85 PathProgramCache]: Analyzing trace with hash -302774542, now seen corresponding path program 1 times [2024-11-10 05:26:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:26:21,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508240822] [2024-11-10 05:26:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:26:21,145 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-10 05:26:21,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:26:21,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:26:21,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 05:26:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:26:21,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 05:26:21,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:26:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 788 proven. 90 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2024-11-10 05:26:23,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:26:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 99 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2024-11-10 05:26:25,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:26:25,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508240822] [2024-11-10 05:26:25,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508240822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:26:25,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:26:25,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2024-11-10 05:26:25,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810939072] [2024-11-10 05:26:25,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:26:25,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 05:26:25,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:26:25,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 05:26:25,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-10 05:26:25,765 INFO L87 Difference]: Start difference. First operand 156 states and 225 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-10 05:26:30,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:26:32,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:26:32,946 INFO L93 Difference]: Finished difference Result 407 states and 554 transitions. [2024-11-10 05:26:32,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-10 05:26:32,948 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 172 [2024-11-10 05:26:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:26:32,954 INFO L225 Difference]: With dead ends: 407 [2024-11-10 05:26:32,954 INFO L226 Difference]: Without dead ends: 328 [2024-11-10 05:26:32,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=589, Invalid=1573, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 05:26:32,957 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 490 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-10 05:26:32,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 445 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-10 05:26:32,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-10 05:26:33,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 292. [2024-11-10 05:26:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 185 states have (on average 1.1675675675675676) internal successors, (216), 186 states have internal predecessors, (216), 90 states have call successors, (90), 16 states have call predecessors, (90), 16 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-10 05:26:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 396 transitions. [2024-11-10 05:26:33,015 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 396 transitions. Word has length 172 [2024-11-10 05:26:33,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:26:33,017 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 396 transitions. [2024-11-10 05:26:33,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-10 05:26:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 396 transitions. [2024-11-10 05:26:33,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 05:26:33,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:26:33,021 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 05:26:33,041 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 (5)] Forceful destruction successful, exit code 0 [2024-11-10 05:26:33,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:26:33,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:26:33,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:26:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1345077457, now seen corresponding path program 1 times [2024-11-10 05:26:33,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:26:33,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142060710] [2024-11-10 05:26:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:26:33,223 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-10 05:26:33,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:26:33,227 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:26:33,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 05:26:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:26:33,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 05:26:33,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:26:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 46 proven. 576 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-10 05:26:38,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:26:39,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:26:39,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142060710] [2024-11-10 05:26:39,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142060710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:26:39,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [270123115] [2024-11-10 05:26:39,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:26:39,015 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 05:26:39,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 05:26:39,016 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 05:26:39,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-10 05:26:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:26:40,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 05:26:40,056 INFO L278 TraceCheckSpWp]: Computing forward predicates...