./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.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 2add2f6a05efd3a958590ac2ce53eb78a564401181f189a0f9c561805fb8c5f3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:38:18,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:38:18,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:38:18,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:38:18,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:38:18,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:38:18,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:38:18,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:38:18,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:38:18,166 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:38:18,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:38:18,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:38:18,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:38:18,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:38:18,170 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:38:18,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:38:18,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:38:18,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:38:18,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:38:18,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:38:18,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:38:18,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:38:18,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:38:18,193 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:38:18,193 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:38:18,194 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:38:18,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:38:18,194 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:38:18,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:38:18,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:38:18,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:38:18,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:38:18,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:38:18,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:38:18,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:38:18,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:38:18,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:38:18,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:38:18,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:38:18,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:38:18,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:38:18,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:38:18,199 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 -> 2add2f6a05efd3a958590ac2ce53eb78a564401181f189a0f9c561805fb8c5f3 [2024-10-13 01:38:18,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:38:18,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:38:18,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:38:18,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:38:18,469 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:38:18,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2024-10-13 01:38:19,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:38:20,065 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:38:20,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2024-10-13 01:38:20,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa1802d18/bbc86d8b0e674b588180fb492fc1f573/FLAG05e2dd6ea [2024-10-13 01:38:20,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa1802d18/bbc86d8b0e674b588180fb492fc1f573 [2024-10-13 01:38:20,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:38:20,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:38:20,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:38:20,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:38:20,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:38:20,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:38:20" (1/1) ... [2024-10-13 01:38:20,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1189db3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20, skipping insertion in model container [2024-10-13 01:38:20,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:38:20" (1/1) ... [2024-10-13 01:38:20,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:38:20,313 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i[919,932] [2024-10-13 01:38:20,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:38:20,402 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:38:20,413 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i[919,932] [2024-10-13 01:38:20,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:38:20,484 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:38:20,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20 WrapperNode [2024-10-13 01:38:20,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:38:20,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:38:20,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:38:20,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:38:20,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20" (1/1) ... [2024-10-13 01:38:20,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20" (1/1) ... [2024-10-13 01:38:20,573 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 276 [2024-10-13 01:38:20,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:38:20,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:38:20,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:38:20,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:38:20,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20" (1/1) ... [2024-10-13 01:38:20,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20" (1/1) ... [2024-10-13 01:38:20,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20" (1/1) ... [2024-10-13 01:38:20,629 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 01:38:20,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20" (1/1) ... [2024-10-13 01:38:20,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20" (1/1) ... [2024-10-13 01:38:20,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20" (1/1) ... [2024-10-13 01:38:20,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20" (1/1) ... [2024-10-13 01:38:20,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20" (1/1) ... [2024-10-13 01:38:20,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20" (1/1) ... [2024-10-13 01:38:20,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:38:20,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:38:20,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:38:20,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:38:20,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20" (1/1) ... [2024-10-13 01:38:20,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:38:20,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:38:20,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:38:20,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:38:20,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:38:20,785 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:38:20,786 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:38:20,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:38:20,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:38:20,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:38:20,885 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:38:20,887 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:38:21,515 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-13 01:38:21,515 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:38:21,566 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:38:21,568 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:38:21,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:38:21 BoogieIcfgContainer [2024-10-13 01:38:21,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:38:21,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:38:21,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:38:21,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:38:21,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:38:20" (1/3) ... [2024-10-13 01:38:21,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4177d243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:38:21, skipping insertion in model container [2024-10-13 01:38:21,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:20" (2/3) ... [2024-10-13 01:38:21,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4177d243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:38:21, skipping insertion in model container [2024-10-13 01:38:21,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:38:21" (3/3) ... [2024-10-13 01:38:21,579 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2024-10-13 01:38:21,593 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:38:21,593 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:38:21,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:38:21,659 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;@2cde344a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:38:21,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:38:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:38:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-13 01:38:21,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:21,689 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:21,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:21,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash -496507857, now seen corresponding path program 1 times [2024-10-13 01:38:21,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:21,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327102409] [2024-10-13 01:38:21,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:21,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:38:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 01:38:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:38:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:38:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:38:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:38:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:38:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:38:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:38:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:38:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:38:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:38:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:38:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:38:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:38:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:38:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:38:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:38:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:38:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:38:22,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:22,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327102409] [2024-10-13 01:38:22,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327102409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:22,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:22,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:38:22,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872151581] [2024-10-13 01:38:22,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:22,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:38:22,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:22,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:38:22,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:38:22,352 INFO L87 Difference]: Start difference. First operand has 113 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:38:22,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:22,409 INFO L93 Difference]: Finished difference Result 223 states and 392 transitions. [2024-10-13 01:38:22,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:38:22,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 207 [2024-10-13 01:38:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:22,424 INFO L225 Difference]: With dead ends: 223 [2024-10-13 01:38:22,424 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 01:38:22,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:38:22,434 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:22,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:38:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 01:38:22,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-13 01:38:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:38:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 176 transitions. [2024-10-13 01:38:22,486 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 176 transitions. Word has length 207 [2024-10-13 01:38:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:22,486 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 176 transitions. [2024-10-13 01:38:22,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:38:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 176 transitions. [2024-10-13 01:38:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-13 01:38:22,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:22,492 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:22,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:38:22,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:22,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:22,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1658967897, now seen corresponding path program 1 times [2024-10-13 01:38:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:22,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911700419] [2024-10-13 01:38:22,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:22,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:38:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:22,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 01:38:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:38:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:38:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:38:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:38:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:38:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:38:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:38:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:38:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:38:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:38:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:38:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:38:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:38:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:38:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:38:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:38:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:38:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:38:23,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:23,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911700419] [2024-10-13 01:38:23,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911700419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:23,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:23,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:38:23,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460780119] [2024-10-13 01:38:23,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:23,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:38:23,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:23,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:38:23,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:38:23,097 INFO L87 Difference]: Start difference. First operand 111 states and 176 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:38:23,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:23,156 INFO L93 Difference]: Finished difference Result 222 states and 353 transitions. [2024-10-13 01:38:23,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:38:23,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-10-13 01:38:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:23,163 INFO L225 Difference]: With dead ends: 222 [2024-10-13 01:38:23,163 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 01:38:23,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:38:23,165 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:23,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:38:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 01:38:23,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-13 01:38:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:38:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 177 transitions. [2024-10-13 01:38:23,187 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 177 transitions. Word has length 207 [2024-10-13 01:38:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:23,193 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 177 transitions. [2024-10-13 01:38:23,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:38:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 177 transitions. [2024-10-13 01:38:23,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-13 01:38:23,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:23,200 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:23,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:38:23,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:23,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:23,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2058893714, now seen corresponding path program 1 times [2024-10-13 01:38:23,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:23,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982946733] [2024-10-13 01:38:23,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:23,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:38:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 01:38:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:38:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:38:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:38:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:38:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:38:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:38:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:38:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:38:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:38:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:38:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:38:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:38:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:38:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:38:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:38:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:38:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:38:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:38:24,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982946733] [2024-10-13 01:38:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982946733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:24,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:24,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 01:38:24,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707617964] [2024-10-13 01:38:24,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:24,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 01:38:24,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:24,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 01:38:24,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 01:38:24,189 INFO L87 Difference]: Start difference. First operand 112 states and 177 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:38:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:25,699 INFO L93 Difference]: Finished difference Result 468 states and 727 transitions. [2024-10-13 01:38:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 01:38:25,700 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 208 [2024-10-13 01:38:25,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:25,704 INFO L225 Difference]: With dead ends: 468 [2024-10-13 01:38:25,704 INFO L226 Difference]: Without dead ends: 357 [2024-10-13 01:38:25,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-10-13 01:38:25,706 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 407 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:25,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1284 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 01:38:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-13 01:38:25,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 310. [2024-10-13 01:38:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 233 states have (on average 1.4849785407725322) internal successors, (346), 235 states have internal predecessors, (346), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 01:38:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 490 transitions. [2024-10-13 01:38:25,763 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 490 transitions. Word has length 208 [2024-10-13 01:38:25,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:25,764 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 490 transitions. [2024-10-13 01:38:25,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:38:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 490 transitions. [2024-10-13 01:38:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-13 01:38:25,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:25,770 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:25,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:38:25,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:25,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:25,771 INFO L85 PathProgramCache]: Analyzing trace with hash -253455380, now seen corresponding path program 1 times [2024-10-13 01:38:25,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:25,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9276596] [2024-10-13 01:38:25,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:25,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:38:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 01:38:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:38:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:38:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:38:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:38:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:38:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:38:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:38:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:38:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:38:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:38:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:38:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:38:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:38:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:38:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:38:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:38:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:38:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:38:26,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:26,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9276596] [2024-10-13 01:38:26,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9276596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:26,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:26,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 01:38:26,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014756269] [2024-10-13 01:38:26,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:26,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 01:38:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 01:38:26,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 01:38:26,428 INFO L87 Difference]: Start difference. First operand 310 states and 490 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:38:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:27,318 INFO L93 Difference]: Finished difference Result 630 states and 972 transitions. [2024-10-13 01:38:27,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 01:38:27,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-10-13 01:38:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:27,327 INFO L225 Difference]: With dead ends: 630 [2024-10-13 01:38:27,327 INFO L226 Difference]: Without dead ends: 488 [2024-10-13 01:38:27,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-13 01:38:27,332 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 205 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:27,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1243 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 01:38:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-13 01:38:27,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 446. [2024-10-13 01:38:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 357 states have (on average 1.4873949579831933) internal successors, (531), 362 states have internal predecessors, (531), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 75 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 01:38:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 691 transitions. [2024-10-13 01:38:27,389 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 691 transitions. Word has length 208 [2024-10-13 01:38:27,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:27,390 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 691 transitions. [2024-10-13 01:38:27,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:38:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 691 transitions. [2024-10-13 01:38:27,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-13 01:38:27,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:27,394 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:27,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 01:38:27,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:27,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:27,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1877500574, now seen corresponding path program 1 times [2024-10-13 01:38:27,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:27,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496408776] [2024-10-13 01:38:27,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:27,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:38:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 01:38:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:38:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:38:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:38:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:38:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:38:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:38:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:38:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:38:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:38:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:38:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:38:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:38:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:38:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:38:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:38:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:38:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:38:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:38:28,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:28,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496408776] [2024-10-13 01:38:28,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496408776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:28,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:28,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 01:38:28,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782878250] [2024-10-13 01:38:28,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:28,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 01:38:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:28,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 01:38:28,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 01:38:28,093 INFO L87 Difference]: Start difference. First operand 446 states and 691 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:38:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:29,120 INFO L93 Difference]: Finished difference Result 1251 states and 1927 transitions. [2024-10-13 01:38:29,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 01:38:29,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209 [2024-10-13 01:38:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:29,125 INFO L225 Difference]: With dead ends: 1251 [2024-10-13 01:38:29,125 INFO L226 Difference]: Without dead ends: 806 [2024-10-13 01:38:29,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-13 01:38:29,131 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 1246 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:29,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 908 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 01:38:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-10-13 01:38:29,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 762. [2024-10-13 01:38:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 627 states have (on average 1.5023923444976077) internal successors, (942), 636 states have internal predecessors, (942), 120 states have call successors, (120), 14 states have call predecessors, (120), 14 states have return successors, (120), 111 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-13 01:38:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1182 transitions. [2024-10-13 01:38:29,203 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1182 transitions. Word has length 209 [2024-10-13 01:38:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:29,204 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 1182 transitions. [2024-10-13 01:38:29,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:38:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1182 transitions. [2024-10-13 01:38:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-13 01:38:29,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:29,207 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:29,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 01:38:29,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:29,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1136482841, now seen corresponding path program 1 times [2024-10-13 01:38:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:29,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875748499] [2024-10-13 01:38:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:29,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:38:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 01:38:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:38:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:38:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:38:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:38:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:38:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:38:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:38:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:38:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:38:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:38:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:38:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:38:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:38:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:38:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:38:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:38:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:38:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:38:30,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:30,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875748499] [2024-10-13 01:38:30,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875748499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:30,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:30,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 01:38:30,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645777034] [2024-10-13 01:38:30,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:30,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 01:38:30,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:30,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 01:38:30,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 01:38:30,156 INFO L87 Difference]: Start difference. First operand 762 states and 1182 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:38:32,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:32,171 INFO L93 Difference]: Finished difference Result 2049 states and 3132 transitions. [2024-10-13 01:38:32,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 01:38:32,172 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-10-13 01:38:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:32,178 INFO L225 Difference]: With dead ends: 2049 [2024-10-13 01:38:32,179 INFO L226 Difference]: Without dead ends: 1288 [2024-10-13 01:38:32,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2024-10-13 01:38:32,182 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 399 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:32,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1039 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 01:38:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2024-10-13 01:38:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 910. [2024-10-13 01:38:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 769 states have (on average 1.5279583875162548) internal successors, (1175), 779 states have internal predecessors, (1175), 124 states have call successors, (124), 16 states have call predecessors, (124), 16 states have return successors, (124), 114 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-13 01:38:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1423 transitions. [2024-10-13 01:38:32,266 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1423 transitions. Word has length 209 [2024-10-13 01:38:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:32,267 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1423 transitions. [2024-10-13 01:38:32,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:38:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1423 transitions. [2024-10-13 01:38:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-13 01:38:32,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:32,271 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:32,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 01:38:32,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:32,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:32,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1005764771, now seen corresponding path program 1 times [2024-10-13 01:38:32,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:32,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230091628] [2024-10-13 01:38:32,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:32,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:38:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 01:38:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:38:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:38:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:38:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:38:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:38:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:38:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:38:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:38:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:38:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:38:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:38:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:38:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:38:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:38:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:38:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:38:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:38:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:38:32,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:32,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230091628] [2024-10-13 01:38:32,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230091628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:32,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:32,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 01:38:32,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822740931] [2024-10-13 01:38:32,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:32,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 01:38:32,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:32,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 01:38:32,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 01:38:32,657 INFO L87 Difference]: Start difference. First operand 910 states and 1423 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:38:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:33,360 INFO L93 Difference]: Finished difference Result 2130 states and 3307 transitions. [2024-10-13 01:38:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 01:38:33,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-10-13 01:38:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:33,367 INFO L225 Difference]: With dead ends: 2130 [2024-10-13 01:38:33,367 INFO L226 Difference]: Without dead ends: 1221 [2024-10-13 01:38:33,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 01:38:33,370 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 66 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:33,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 731 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 01:38:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2024-10-13 01:38:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 969. [2024-10-13 01:38:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 828 states have (on average 1.53743961352657) internal successors, (1273), 838 states have internal predecessors, (1273), 124 states have call successors, (124), 16 states have call predecessors, (124), 16 states have return successors, (124), 114 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-13 01:38:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1521 transitions. [2024-10-13 01:38:33,453 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1521 transitions. Word has length 209 [2024-10-13 01:38:33,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:33,454 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1521 transitions. [2024-10-13 01:38:33,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-13 01:38:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1521 transitions. [2024-10-13 01:38:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-13 01:38:33,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:33,457 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:33,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 01:38:33,458 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:33,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:33,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2011514080, now seen corresponding path program 1 times [2024-10-13 01:38:33,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:33,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889014021] [2024-10-13 01:38:33,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:33,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:38:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 01:38:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:38:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:38:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:38:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:38:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:38:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:38:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:38:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:38:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:38:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:38:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:38:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:38:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:38:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:38:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:38:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:38:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:38:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 01:38:33,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:33,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889014021] [2024-10-13 01:38:33,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889014021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:33,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:33,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 01:38:33,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687792685] [2024-10-13 01:38:33,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:33,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 01:38:33,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:33,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 01:38:33,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 01:38:33,884 INFO L87 Difference]: Start difference. First operand 969 states and 1521 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:38:34,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:34,491 INFO L93 Difference]: Finished difference Result 2492 states and 3885 transitions. [2024-10-13 01:38:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 01:38:34,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209 [2024-10-13 01:38:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:34,500 INFO L225 Difference]: With dead ends: 2492 [2024-10-13 01:38:34,501 INFO L226 Difference]: Without dead ends: 1524 [2024-10-13 01:38:34,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:38:34,505 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 175 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:34,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 406 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 01:38:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-10-13 01:38:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 984. [2024-10-13 01:38:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 843 states have (on average 1.5432977461447213) internal successors, (1301), 853 states have internal predecessors, (1301), 124 states have call successors, (124), 16 states have call predecessors, (124), 16 states have return successors, (124), 114 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-13 01:38:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1549 transitions. [2024-10-13 01:38:34,595 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1549 transitions. Word has length 209 [2024-10-13 01:38:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:34,596 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1549 transitions. [2024-10-13 01:38:34,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:38:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1549 transitions. [2024-10-13 01:38:34,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-13 01:38:34,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:34,600 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:34,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 01:38:34,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:34,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:34,601 INFO L85 PathProgramCache]: Analyzing trace with hash 493137539, now seen corresponding path program 1 times [2024-10-13 01:38:34,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:34,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318869831] [2024-10-13 01:38:34,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:34,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:38:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 01:38:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:38:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:38:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:38:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:38:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:38:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:38:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:38:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:38:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:38:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:38:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:38:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:38:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:38:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:38:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:38:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:38:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:38:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:38:34,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:34,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318869831] [2024-10-13 01:38:34,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318869831] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:38:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43566129] [2024-10-13 01:38:34,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:34,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:34,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:38:34,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:38:35,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 01:38:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:35,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 01:38:35,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:38:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 643 proven. 75 refuted. 0 times theorem prover too weak. 1266 trivial. 0 not checked. [2024-10-13 01:38:35,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:38:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:38:35,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43566129] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:38:35,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:38:35,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 15 [2024-10-13 01:38:35,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118288988] [2024-10-13 01:38:35,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:38:35,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 01:38:35,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:35,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 01:38:35,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-13 01:38:35,810 INFO L87 Difference]: Start difference. First operand 984 states and 1549 transitions. Second operand has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 states have internal predecessors, (103), 3 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (88), 3 states have call predecessors, (88), 3 states have call successors, (88) [2024-10-13 01:38:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:36,621 INFO L93 Difference]: Finished difference Result 1932 states and 2995 transitions. [2024-10-13 01:38:36,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 01:38:36,622 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 states have internal predecessors, (103), 3 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (88), 3 states have call predecessors, (88), 3 states have call successors, (88) Word has length 209 [2024-10-13 01:38:36,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:36,627 INFO L225 Difference]: With dead ends: 1932 [2024-10-13 01:38:36,627 INFO L226 Difference]: Without dead ends: 949 [2024-10-13 01:38:36,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2024-10-13 01:38:36,631 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 252 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:36,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 687 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 01:38:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-10-13 01:38:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 937. [2024-10-13 01:38:36,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 785 states have (on average 1.4891719745222929) internal successors, (1169), 795 states have internal predecessors, (1169), 124 states have call successors, (124), 27 states have call predecessors, (124), 27 states have return successors, (124), 114 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-13 01:38:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1417 transitions. [2024-10-13 01:38:36,788 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1417 transitions. Word has length 209 [2024-10-13 01:38:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:36,789 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1417 transitions. [2024-10-13 01:38:36,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 states have internal predecessors, (103), 3 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (88), 3 states have call predecessors, (88), 3 states have call successors, (88) [2024-10-13 01:38:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1417 transitions. [2024-10-13 01:38:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-13 01:38:36,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:36,794 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:36,813 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-10-13 01:38:36,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:36,995 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:36,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1811974554, now seen corresponding path program 1 times [2024-10-13 01:38:36,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:36,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516697694] [2024-10-13 01:38:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:38:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 01:38:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:38:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:38:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:38:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:38:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:38:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:38:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:38:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:38:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:38:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:38:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:38:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:38:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:38:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:38:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:38:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:38:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:38:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:38:37,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:37,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516697694] [2024-10-13 01:38:37,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516697694] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:38:37,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596207054] [2024-10-13 01:38:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:37,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:37,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:38:37,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:38:37,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 01:38:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:37,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 01:38:37,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:38:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 423 proven. 9 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2024-10-13 01:38:37,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:38:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:38:37,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596207054] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:38:37,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:38:37,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-13 01:38:37,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979480511] [2024-10-13 01:38:37,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:38:37,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 01:38:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:37,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 01:38:37,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:38:37,783 INFO L87 Difference]: Start difference. First operand 937 states and 1417 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-13 01:38:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:38,161 INFO L93 Difference]: Finished difference Result 1866 states and 2801 transitions. [2024-10-13 01:38:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 01:38:38,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 210 [2024-10-13 01:38:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:38,167 INFO L225 Difference]: With dead ends: 1866 [2024-10-13 01:38:38,167 INFO L226 Difference]: Without dead ends: 930 [2024-10-13 01:38:38,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-13 01:38:38,170 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 209 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:38,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 323 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:38:38,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2024-10-13 01:38:38,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 924. [2024-10-13 01:38:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 769 states have (on average 1.4317295188556567) internal successors, (1101), 779 states have internal predecessors, (1101), 124 states have call successors, (124), 30 states have call predecessors, (124), 30 states have return successors, (124), 114 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-13 01:38:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1349 transitions. [2024-10-13 01:38:38,281 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1349 transitions. Word has length 210 [2024-10-13 01:38:38,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:38,282 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1349 transitions. [2024-10-13 01:38:38,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-13 01:38:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1349 transitions. [2024-10-13 01:38:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-13 01:38:38,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:38,286 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:38,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 01:38:38,486 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,SelfDestructingSolverStorable9 [2024-10-13 01:38:38,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:38,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:38,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2088189060, now seen corresponding path program 1 times [2024-10-13 01:38:38,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:38,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728079259] [2024-10-13 01:38:38,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:38,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:38:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:38:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:38:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 01:38:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:38:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:38:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:38:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 01:38:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:38:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:38:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:38:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:38:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 01:38:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:38:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:38:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:38:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 01:38:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:38:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 01:38:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 01:38:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 01:38:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 01:38:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 01:38:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:38:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:38:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 01:38:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:38:38,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:38,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728079259] [2024-10-13 01:38:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728079259] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:38:38,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579731270] [2024-10-13 01:38:38,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:38,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:38,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:38:38,898 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-10-13 01:38:38,901 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-10-13 01:38:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:39,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 01:38:39,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:38:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 879 proven. 30 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2024-10-13 01:38:39,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:38:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:38:39,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579731270] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:38:39,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:38:39,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 15 [2024-10-13 01:38:39,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307167980] [2024-10-13 01:38:39,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:38:39,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 01:38:39,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:39,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 01:38:39,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-13 01:38:39,638 INFO L87 Difference]: Start difference. First operand 924 states and 1349 transitions. Second operand has 15 states, 15 states have (on average 8.266666666666667) internal successors, (124), 15 states have internal predecessors, (124), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) [2024-10-13 01:38:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:40,329 INFO L93 Difference]: Finished difference Result 1903 states and 2761 transitions. [2024-10-13 01:38:40,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 01:38:40,330 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.266666666666667) internal successors, (124), 15 states have internal predecessors, (124), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) Word has length 211 [2024-10-13 01:38:40,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:40,335 INFO L225 Difference]: With dead ends: 1903 [2024-10-13 01:38:40,336 INFO L226 Difference]: Without dead ends: 980 [2024-10-13 01:38:40,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2024-10-13 01:38:40,339 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 282 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:40,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 658 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 01:38:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2024-10-13 01:38:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 962. [2024-10-13 01:38:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 801 states have (on average 1.414481897627965) internal successors, (1133), 811 states have internal predecessors, (1133), 124 states have call successors, (124), 36 states have call predecessors, (124), 36 states have return successors, (124), 114 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-13 01:38:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1381 transitions. [2024-10-13 01:38:40,457 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1381 transitions. Word has length 211 [2024-10-13 01:38:40,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:40,458 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1381 transitions. [2024-10-13 01:38:40,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.266666666666667) internal successors, (124), 15 states have internal predecessors, (124), 5 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) [2024-10-13 01:38:40,458 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1381 transitions. [2024-10-13 01:38:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-13 01:38:40,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:40,461 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:40,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 01:38:40,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:40,662 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:40,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:40,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1278842434, now seen corresponding path program 1 times [2024-10-13 01:38:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:40,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889904311] [2024-10-13 01:38:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:40,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:38:40,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817921289] [2024-10-13 01:38:40,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:40,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:40,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:38:40,774 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:38:40,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 01:38:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:40,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 01:38:40,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:38:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1030 proven. 96 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2024-10-13 01:38:41,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:38:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-13 01:38:42,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:42,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889904311] [2024-10-13 01:38:42,621 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 01:38:42,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817921289] [2024-10-13 01:38:42,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817921289] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:38:42,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:38:42,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-10-13 01:38:42,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215533674] [2024-10-13 01:38:42,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:38:42,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 01:38:42,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:42,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 01:38:42,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2024-10-13 01:38:42,626 INFO L87 Difference]: Start difference. First operand 962 states and 1381 transitions. Second operand has 23 states, 23 states have (on average 4.173913043478261) internal successors, (96), 22 states have internal predecessors, (96), 4 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2024-10-13 01:38:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:44,634 INFO L93 Difference]: Finished difference Result 2329 states and 3258 transitions. [2024-10-13 01:38:44,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-13 01:38:44,635 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.173913043478261) internal successors, (96), 22 states have internal predecessors, (96), 4 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) Word has length 211 [2024-10-13 01:38:44,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:44,643 INFO L225 Difference]: With dead ends: 2329 [2024-10-13 01:38:44,644 INFO L226 Difference]: Without dead ends: 1368 [2024-10-13 01:38:44,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2024-10-13 01:38:44,651 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 1452 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 203 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:44,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 831 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1344 Invalid, 12 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 01:38:44,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-10-13 01:38:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1154. [2024-10-13 01:38:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 930 states have (on average 1.3591397849462366) internal successors, (1264), 943 states have internal predecessors, (1264), 166 states have call successors, (166), 57 states have call predecessors, (166), 57 states have return successors, (166), 153 states have call predecessors, (166), 166 states have call successors, (166) [2024-10-13 01:38:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1596 transitions. [2024-10-13 01:38:44,813 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1596 transitions. Word has length 211 [2024-10-13 01:38:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:44,813 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1596 transitions. [2024-10-13 01:38:44,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.173913043478261) internal successors, (96), 22 states have internal predecessors, (96), 4 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2024-10-13 01:38:44,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1596 transitions. [2024-10-13 01:38:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-13 01:38:44,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:44,818 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:44,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 01:38:45,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:45,019 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:45,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:45,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1440740057, now seen corresponding path program 1 times [2024-10-13 01:38:45,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:45,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206876606] [2024-10-13 01:38:45,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:45,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:38:45,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392375128] [2024-10-13 01:38:45,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:45,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:38:45,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:38:45,135 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:38:45,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 01:38:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:38:45,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 01:38:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:38:45,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 01:38:45,582 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 01:38:45,583 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 01:38:45,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 01:38:45,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 01:38:45,788 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:38:45,933 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 01:38:45,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:38:45 BoogieIcfgContainer [2024-10-13 01:38:45,937 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 01:38:45,937 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 01:38:45,938 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 01:38:45,938 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 01:38:45,939 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:38:21" (3/4) ... [2024-10-13 01:38:45,941 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 01:38:45,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 01:38:45,942 INFO L158 Benchmark]: Toolchain (without parser) took 25847.12ms. Allocated memory was 172.0MB in the beginning and 488.6MB in the end (delta: 316.7MB). Free memory was 117.4MB in the beginning and 208.2MB in the end (delta: -90.7MB). Peak memory consumption was 228.0MB. Max. memory is 16.1GB. [2024-10-13 01:38:45,942 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 172.0MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:38:45,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.36ms. Allocated memory is still 172.0MB. Free memory was 117.1MB in the beginning and 100.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 01:38:45,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.81ms. Allocated memory is still 172.0MB. Free memory was 100.0MB in the beginning and 93.0MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 01:38:45,943 INFO L158 Benchmark]: Boogie Preprocessor took 117.07ms. Allocated memory is still 172.0MB. Free memory was 93.0MB in the beginning and 85.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 01:38:45,944 INFO L158 Benchmark]: RCFGBuilder took 875.64ms. Allocated memory was 172.0MB in the beginning and 230.7MB in the end (delta: 58.7MB). Free memory was 85.7MB in the beginning and 182.3MB in the end (delta: -96.6MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2024-10-13 01:38:45,944 INFO L158 Benchmark]: TraceAbstraction took 24365.99ms. Allocated memory was 230.7MB in the beginning and 488.6MB in the end (delta: 257.9MB). Free memory was 181.3MB in the beginning and 208.2MB in the end (delta: -26.9MB). Peak memory consumption was 232.1MB. Max. memory is 16.1GB. [2024-10-13 01:38:45,944 INFO L158 Benchmark]: Witness Printer took 4.72ms. Allocated memory is still 488.6MB. Free memory is still 208.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:38:45,945 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 172.0MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.36ms. Allocated memory is still 172.0MB. Free memory was 117.1MB in the beginning and 100.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.81ms. Allocated memory is still 172.0MB. Free memory was 100.0MB in the beginning and 93.0MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.07ms. Allocated memory is still 172.0MB. Free memory was 93.0MB in the beginning and 85.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 875.64ms. Allocated memory was 172.0MB in the beginning and 230.7MB in the end (delta: 58.7MB). Free memory was 85.7MB in the beginning and 182.3MB in the end (delta: -96.6MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * TraceAbstraction took 24365.99ms. Allocated memory was 230.7MB in the beginning and 488.6MB in the end (delta: 257.9MB). Free memory was 181.3MB in the beginning and 208.2MB in the end (delta: -26.9MB). Peak memory consumption was 232.1MB. Max. memory is 16.1GB. * Witness Printer took 4.72ms. Allocated memory is still 488.6MB. Free memory is still 208.2MB. 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 180, overapproximation of bitwiseOr at line 98, overapproximation of someBinaryArithmeticDOUBLEoperation at line 59, overapproximation of someUnaryDOUBLEoperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] signed char var_1_2 = -1; [L24] signed char var_1_3 = 10; [L25] signed long int var_1_5 = 5; [L26] unsigned char var_1_6 = 0; [L27] double var_1_7 = 24.8; [L28] double var_1_8 = 500.5; [L29] double var_1_9 = 2.4; [L30] double var_1_10 = 0.4; [L31] double var_1_11 = 255.8; [L32] double var_1_12 = 50.75; [L33] unsigned char var_1_13 = 4; [L34] unsigned char var_1_14 = 200; [L35] unsigned char var_1_15 = 25; [L36] unsigned char var_1_16 = 128; [L37] unsigned char var_1_17 = 64; [L38] unsigned char var_1_18 = 32; [L39] unsigned char var_1_19 = 32; [L40] unsigned long int var_1_20 = 1; [L41] float var_1_21 = 9999999999.2; [L42] double var_1_23 = 10.875; [L43] unsigned char var_1_24 = 0; [L44] unsigned char var_1_25 = 0; [L45] float var_1_26 = 1000000000000.6; [L46] unsigned long int var_1_27 = 2609431563; [L47] float var_1_30 = 8.8; [L48] unsigned short int var_1_32 = 1; [L49] signed char var_1_36 = 64; [L50] float var_1_37 = 9.5; [L51] signed long int var_1_41 = 200; [L52] signed char var_1_42 = 2; [L53] signed long int var_1_43 = 2; [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] FCALL updateLastVariables() [L193] CALL updateVariables() [L131] var_1_2 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_2 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L132] RET assume_abort_if_not(var_1_2 >= -1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L133] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L133] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L134] var_1_3 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L135] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L136] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L136] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L137] var_1_5 = __VERIFIER_nondet_long() [L138] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L138] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L139] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L139] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L140] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L140] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L141] var_1_6 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L142] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L143] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L143] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L144] var_1_8 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L145] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L146] var_1_9 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L147] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L148] var_1_10 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L149] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L150] var_1_11 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L151] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L152] var_1_12 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L153] RET assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L154] var_1_14 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_14 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L155] RET assume_abort_if_not(var_1_14 >= 190) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L156] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L156] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L157] var_1_15 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L158] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L159] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L159] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L160] var_1_16 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_16 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L161] RET assume_abort_if_not(var_1_16 >= 127) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L162] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L162] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L163] var_1_17 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L164] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L165] CALL assume_abort_if_not(var_1_17 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L165] RET assume_abort_if_not(var_1_17 <= 64) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L166] var_1_18 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L167] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L168] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L168] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L169] var_1_19 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L170] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L171] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L171] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L172] var_1_25 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L173] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L174] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L174] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L175] var_1_27 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_27 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L176] RET assume_abort_if_not(var_1_27 >= 2147483647) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L177] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L177] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L178] var_1_37 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_37 >= -922337.2036854776000e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L179] RET assume_abort_if_not((var_1_37 >= -922337.2036854776000e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L180] CALL assume_abort_if_not(var_1_37 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L180] RET assume_abort_if_not(var_1_37 != 0.0F) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L193] RET updateVariables() [L194] CALL step() [L57] signed char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=0, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_7=124/5] [L58] COND TRUE -256 <= stepLocal_0 [L59] var_1_7 = (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))) VAL [isInitial=1, var_1_13=4, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1] [L65] COND TRUE var_1_11 <= var_1_9 [L66] var_1_13 = ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) VAL [isInitial=1, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1] [L68] COND TRUE (var_1_2 - var_1_3) > (var_1_13 / var_1_5) [L69] var_1_1 = (128 - var_1_3) VAL [isInitial=1, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1] [L77] EXPR (var_1_2 * var_1_13) & var_1_1 VAL [isInitial=1, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1] [L77] signed long int stepLocal_1 = (var_1_2 * var_1_13) & var_1_1; [L78] COND FALSE !(var_1_3 < stepLocal_1) VAL [isInitial=1, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1] [L81] EXPR var_1_1 & var_1_3 VAL [isInitial=1, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1] [L81] signed long int stepLocal_2 = var_1_1 & var_1_3; [L82] COND FALSE !((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= stepLocal_2) [L89] var_1_21 = var_1_12 VAL [isInitial=1, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1] [L91] unsigned long int stepLocal_3 = var_1_20; VAL [isInitial=1, stepLocal_3=1, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1] [L92] COND TRUE var_1_1 > stepLocal_3 VAL [isInitial=1, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1] [L93] COND TRUE ! (! var_1_6) [L94] var_1_23 = var_1_8 VAL [isInitial=1, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_8=3] [L97] var_1_24 = var_1_25 VAL [isInitial=1, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_8=3] [L98] EXPR 25u | (var_1_27 - 5u) VAL [isInitial=1, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_8=3] [L98] COND TRUE (25u | (var_1_27 - 5u)) >= var_1_5 [L99] var_1_26 = (((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) < 0 ) ? -((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) : ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=-12884901909, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_8=3] [L105] COND TRUE var_1_10 < var_1_8 [L106] var_1_30 = ((((var_1_8) > (var_1_11)) ? (var_1_8) : (var_1_11))) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=-12884901909, var_1_2=0, var_1_30=3, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_8=3] [L108] EXPR (var_1_1 / var_1_14) & var_1_5 VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=-12884901909, var_1_2=0, var_1_30=3, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_8=3] [L108] COND TRUE (-1 - var_1_15) < ((var_1_1 / var_1_14) & var_1_5) [L109] EXPR var_1_14 >> var_1_15 VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=-12884901909, var_1_2=0, var_1_30=3, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_8=3] [L109] COND TRUE (- ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < (var_1_14 >> var_1_15) [L110] var_1_32 = var_1_15 VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=-12884901909, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_8=3] [L117] COND FALSE !(var_1_10 < ((var_1_8 / var_1_37) + var_1_11)) [L122] var_1_36 = ((((var_1_18) > ((var_1_18 - var_1_18))) ? (var_1_18) : ((var_1_18 - var_1_18)))) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=-12884901909, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=63, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_8=3] [L124] EXPR var_1_27 >> var_1_15 VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=-12884901909, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=63, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-21, var_1_6=1, var_1_8=3] [L124] COND FALSE !((var_1_27 >> var_1_15) <= var_1_18) [L127] var_1_42 = var_1_17 [L128] var_1_43 = var_1_3 [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR (((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=-12884901909, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=63, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-21, var_1_6=1, var_1_8=3] [L185] EXPR ((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12))) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=-12884901909, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=63, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-21, var_1_6=1, var_1_8=3] [L185-L186] return (((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12)))) && ((var_1_1 > var_1_20) ? ((! (! var_1_6)) ? (var_1_23 == ((double) var_1_8)) : 1) : 1) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=-12884901909, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=63, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-21, var_1_6=1, var_1_8=3] [L19] reach_error() VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=63, var_1_14=-66, var_1_15=0, var_1_16=-66, var_1_17=320, var_1_18=63, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=-12884901909, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=63, var_1_3=0, var_1_41=200, var_1_42=64, var_1_43=0, var_1_5=-21, var_1_6=1, var_1_8=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.2s, OverallIterations: 13, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 4776 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4693 mSDsluCounter, 8619 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6629 mSDsCounter, 694 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6603 IncrementalHoareTripleChecker+Invalid, 7309 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 694 mSolverCounterUnsat, 1990 mSDtfsCounter, 6603 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2586 GetRequests, 2413 SyntacticMatches, 2 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1154occurred in iteration=12, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 1553 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 3772 NumberOfCodeBlocks, 3772 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3959 ConstructedInterpolants, 1 QuantifiedInterpolants, 11848 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1881 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 37237/37696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 01:38:46,043 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.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 2add2f6a05efd3a958590ac2ce53eb78a564401181f189a0f9c561805fb8c5f3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:38:48,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:38:48,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 01:38:48,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:38:48,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:38:48,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:38:48,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:38:48,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:38:48,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:38:48,229 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:38:48,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:38:48,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:38:48,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:38:48,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:38:48,230 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:38:48,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:38:48,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:38:48,231 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:38:48,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:38:48,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:38:48,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:38:48,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:38:48,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:38:48,236 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 01:38:48,236 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 01:38:48,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:38:48,237 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 01:38:48,237 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:38:48,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:38:48,237 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:38:48,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:38:48,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:38:48,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:38:48,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:38:48,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:38:48,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:38:48,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:38:48,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:38:48,242 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 01:38:48,242 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 01:38:48,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:38:48,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:38:48,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:38:48,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:38:48,244 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 01:38:48,244 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 -> 2add2f6a05efd3a958590ac2ce53eb78a564401181f189a0f9c561805fb8c5f3 [2024-10-13 01:38:48,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:38:48,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:38:48,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:38:48,564 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:38:48,566 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:38:48,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2024-10-13 01:38:50,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:38:50,271 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:38:50,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2024-10-13 01:38:50,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0d8368d2/d5aa0f4ec50f4c0d83e748aba7f171a8/FLAG4c89665d6 [2024-10-13 01:38:50,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0d8368d2/d5aa0f4ec50f4c0d83e748aba7f171a8 [2024-10-13 01:38:50,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:38:50,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:38:50,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:38:50,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:38:50,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:38:50,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:38:50" (1/1) ... [2024-10-13 01:38:50,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca088d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50, skipping insertion in model container [2024-10-13 01:38:50,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:38:50" (1/1) ... [2024-10-13 01:38:50,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:38:50,524 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i[919,932] [2024-10-13 01:38:50,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:38:50,657 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:38:50,669 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i[919,932] [2024-10-13 01:38:50,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:38:50,744 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:38:50,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50 WrapperNode [2024-10-13 01:38:50,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:38:50,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:38:50,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:38:50,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:38:50,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50" (1/1) ... [2024-10-13 01:38:50,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50" (1/1) ... [2024-10-13 01:38:50,805 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-10-13 01:38:50,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:38:50,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:38:50,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:38:50,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:38:50,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50" (1/1) ... [2024-10-13 01:38:50,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50" (1/1) ... [2024-10-13 01:38:50,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50" (1/1) ... [2024-10-13 01:38:50,854 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 01:38:50,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50" (1/1) ... [2024-10-13 01:38:50,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50" (1/1) ... [2024-10-13 01:38:50,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50" (1/1) ... [2024-10-13 01:38:50,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50" (1/1) ... [2024-10-13 01:38:50,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50" (1/1) ... [2024-10-13 01:38:50,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50" (1/1) ... [2024-10-13 01:38:50,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:38:50,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:38:50,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:38:50,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:38:50,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50" (1/1) ... [2024-10-13 01:38:50,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:38:50,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:38:50,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:38:50,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:38:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:38:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 01:38:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:38:50,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:38:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:38:50,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:38:51,070 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:38:51,080 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:39:06,618 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-13 01:39:06,618 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:39:06,708 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:39:06,708 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:39:06,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:39:06 BoogieIcfgContainer [2024-10-13 01:39:06,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:39:06,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:39:06,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:39:06,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:39:06,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:38:50" (1/3) ... [2024-10-13 01:39:06,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f21d93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:39:06, skipping insertion in model container [2024-10-13 01:39:06,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:50" (2/3) ... [2024-10-13 01:39:06,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f21d93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:39:06, skipping insertion in model container [2024-10-13 01:39:06,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:39:06" (3/3) ... [2024-10-13 01:39:06,718 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2024-10-13 01:39:06,734 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:39:06,734 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:39:06,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:39:06,802 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;@594d5b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:39:06,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:39:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:39:06,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 01:39:06,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:39:06,820 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:39:06,820 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:39:06,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:39:06,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2048491174, now seen corresponding path program 1 times [2024-10-13 01:39:06,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:39:06,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790018801] [2024-10-13 01:39:06,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:39:06,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:39:06,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:39:06,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:39:06,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 01:39:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:07,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 01:39:07,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:39:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2024-10-13 01:39:08,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:39:08,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:39:08,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790018801] [2024-10-13 01:39:08,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790018801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:39:08,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:39:08,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:39:08,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714031315] [2024-10-13 01:39:08,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:39:08,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:39:08,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:39:08,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:39:08,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:39:08,108 INFO L87 Difference]: Start difference. First operand has 85 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:39:12,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:39:12,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:39:12,283 INFO L93 Difference]: Finished difference Result 166 states and 302 transitions. [2024-10-13 01:39:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:39:12,322 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 198 [2024-10-13 01:39:12,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:39:12,328 INFO L225 Difference]: With dead ends: 166 [2024-10-13 01:39:12,328 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 01:39:12,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:39:12,334 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:39:12,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 01:39:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 01:39:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-13 01:39:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 01:39:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2024-10-13 01:39:12,381 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 198 [2024-10-13 01:39:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:39:12,381 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2024-10-13 01:39:12,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 01:39:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2024-10-13 01:39:12,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 01:39:12,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:39:12,386 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:39:12,417 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-10-13 01:39:12,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:39:12,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:39:12,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:39:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1459236050, now seen corresponding path program 1 times [2024-10-13 01:39:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:39:12,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057676950] [2024-10-13 01:39:12,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:39:12,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:39:12,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:39:12,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:39:12,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 01:39:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:39:14,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-13 01:39:14,614 INFO L278 TraceCheckSpWp]: Computing forward predicates...