./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-ps-ci_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-ps-ci_file-24.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 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:07:21,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:07:21,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:07:21,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:07:21,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:07:21,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:07:21,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:07:21,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:07:21,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:07:21,460 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:07:21,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:07:21,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:07:21,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:07:21,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:07:21,461 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:07:21,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:07:21,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:07:21,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:07:21,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:07:21,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:07:21,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:07:21,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:07:21,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:07:21,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:07:21,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:07:21,464 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:07:21,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:07:21,464 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:07:21,464 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:07:21,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:07:21,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:07:21,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:07:21,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:07:21,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:07:21,465 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:07:21,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:07:21,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:07:21,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:07:21,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:07:21,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:07:21,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:07:21,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:07:21,468 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 -> 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 [2024-10-14 10:07:21,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:07:21,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:07:21,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:07:21,694 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:07:21,695 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:07:21,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-10-14 10:07:22,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:07:23,061 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:07:23,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-10-14 10:07:23,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee6ce5224/ed97cb5041544d75981590eb661f5aac/FLAG9383db67f [2024-10-14 10:07:23,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee6ce5224/ed97cb5041544d75981590eb661f5aac [2024-10-14 10:07:23,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:07:23,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:07:23,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:07:23,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:07:23,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:07:23,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:23" (1/1) ... [2024-10-14 10:07:23,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@215423d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23, skipping insertion in model container [2024-10-14 10:07:23,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:23" (1/1) ... [2024-10-14 10:07:23,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:07:23,616 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-ps-ci_file-24.i[919,932] [2024-10-14 10:07:23,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:07:23,736 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:07:23,745 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-ps-ci_file-24.i[919,932] [2024-10-14 10:07:23,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:07:23,782 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:07:23,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23 WrapperNode [2024-10-14 10:07:23,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:07:23,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:07:23,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:07:23,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:07:23,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23" (1/1) ... [2024-10-14 10:07:23,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23" (1/1) ... [2024-10-14 10:07:23,824 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 287 [2024-10-14 10:07:23,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:07:23,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:07:23,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:07:23,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:07:23,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23" (1/1) ... [2024-10-14 10:07:23,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23" (1/1) ... [2024-10-14 10:07:23,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23" (1/1) ... [2024-10-14 10:07:23,862 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-14 10:07:23,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23" (1/1) ... [2024-10-14 10:07:23,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23" (1/1) ... [2024-10-14 10:07:23,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23" (1/1) ... [2024-10-14 10:07:23,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23" (1/1) ... [2024-10-14 10:07:23,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23" (1/1) ... [2024-10-14 10:07:23,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23" (1/1) ... [2024-10-14 10:07:23,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:07:23,886 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:07:23,886 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:07:23,886 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:07:23,887 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23" (1/1) ... [2024-10-14 10:07:23,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:07:23,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:07:23,921 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-14 10:07:23,924 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-14 10:07:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:07:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:07:23,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:07:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:07:23,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:07:23,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:07:24,032 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:07:24,034 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:07:24,404 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 10:07:24,405 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:07:24,431 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:07:24,431 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:07:24,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:24 BoogieIcfgContainer [2024-10-14 10:07:24,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:07:24,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:07:24,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:07:24,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:07:24,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:07:23" (1/3) ... [2024-10-14 10:07:24,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3f6476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:24, skipping insertion in model container [2024-10-14 10:07:24,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:23" (2/3) ... [2024-10-14 10:07:24,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3f6476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:24, skipping insertion in model container [2024-10-14 10:07:24,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:24" (3/3) ... [2024-10-14 10:07:24,441 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-10-14 10:07:24,454 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:07:24,455 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:07:24,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:07:24,503 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;@6948e04d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:07:24,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:07:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 80 states have (on average 1.525) internal successors, (122), 81 states have internal predecessors, (122), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 10:07:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 10:07:24,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:24,518 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:24,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:24,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:24,523 INFO L85 PathProgramCache]: Analyzing trace with hash 260404430, now seen corresponding path program 1 times [2024-10-14 10:07:24,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:24,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955153820] [2024-10-14 10:07:24,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:07:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:07:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:07:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 10:07:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:07:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:07:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:07:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 10:07:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:07:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:07:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:07:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:07:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:07:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:07:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:07:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:07:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:07:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:07:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:07:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:07:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:07:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:07:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:07:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:07:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:07:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:07:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:07:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:07:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:07:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:07:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:07:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:07:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:07:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:07:25,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:07:25,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955153820] [2024-10-14 10:07:25,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955153820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:07:25,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:07:25,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:07:25,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868791379] [2024-10-14 10:07:25,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:07:25,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:07:25,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:07:25,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:07:25,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:07:25,377 INFO L87 Difference]: Start difference. First operand has 116 states, 80 states have (on average 1.525) internal successors, (122), 81 states have internal predecessors, (122), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:25,702 INFO L93 Difference]: Finished difference Result 369 states and 672 transitions. [2024-10-14 10:07:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:07:25,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-10-14 10:07:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:25,717 INFO L225 Difference]: With dead ends: 369 [2024-10-14 10:07:25,717 INFO L226 Difference]: Without dead ends: 254 [2024-10-14 10:07:25,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:07:25,725 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 237 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:25,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 471 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:07:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-14 10:07:25,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 223. [2024-10-14 10:07:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 154 states have (on average 1.474025974025974) internal successors, (227), 154 states have internal predecessors, (227), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:07:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 359 transitions. [2024-10-14 10:07:25,805 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 359 transitions. Word has length 209 [2024-10-14 10:07:25,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:25,806 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 359 transitions. [2024-10-14 10:07:25,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:25,807 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 359 transitions. [2024-10-14 10:07:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 10:07:25,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:25,814 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:25,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:07:25,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:25,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:25,816 INFO L85 PathProgramCache]: Analyzing trace with hash 61310808, now seen corresponding path program 1 times [2024-10-14 10:07:25,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:25,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538453847] [2024-10-14 10:07:25,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:25,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:07:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:07:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:07:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 10:07:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:07:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:07:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:07:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 10:07:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:07:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:07:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:07:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:07:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:07:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:07:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:07:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:07:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:07:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:07:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:07:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:07:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:07:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:07:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:07:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:07:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:07:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:07:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:07:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:07:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:25,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:07:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:07:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:07:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:07:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:07:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:07:26,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:07:26,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538453847] [2024-10-14 10:07:26,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538453847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:07:26,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:07:26,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:07:26,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654671223] [2024-10-14 10:07:26,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:07:26,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:07:26,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:07:26,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:07:26,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:07:26,017 INFO L87 Difference]: Start difference. First operand 223 states and 359 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:26,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:26,143 INFO L93 Difference]: Finished difference Result 665 states and 1071 transitions. [2024-10-14 10:07:26,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:07:26,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-10-14 10:07:26,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:26,150 INFO L225 Difference]: With dead ends: 665 [2024-10-14 10:07:26,150 INFO L226 Difference]: Without dead ends: 443 [2024-10-14 10:07:26,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-14 10:07:26,152 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 161 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:26,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 395 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:07:26,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-14 10:07:26,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2024-10-14 10:07:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 304 states have (on average 1.4671052631578947) internal successors, (446), 304 states have internal predecessors, (446), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-10-14 10:07:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 710 transitions. [2024-10-14 10:07:26,230 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 710 transitions. Word has length 210 [2024-10-14 10:07:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:26,231 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 710 transitions. [2024-10-14 10:07:26,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 710 transitions. [2024-10-14 10:07:26,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 10:07:26,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:26,235 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:26,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:07:26,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:26,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:26,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1170839464, now seen corresponding path program 1 times [2024-10-14 10:07:26,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:26,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134696255] [2024-10-14 10:07:26,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:26,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:07:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:07:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:07:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 10:07:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:07:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:07:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:07:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 10:07:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:07:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:07:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:07:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:07:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:07:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:07:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:07:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:07:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:07:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:07:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:07:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:07:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:07:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:07:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:07:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:07:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:07:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:07:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:07:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:07:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:07:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:07:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:07:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:07:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:07:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:07:26,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:07:26,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134696255] [2024-10-14 10:07:26,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134696255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:07:26,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:07:26,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:07:26,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487567936] [2024-10-14 10:07:26,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:07:26,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:07:26,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:07:26,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:07:26,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:07:26,481 INFO L87 Difference]: Start difference. First operand 441 states and 710 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:27,003 INFO L93 Difference]: Finished difference Result 1662 states and 2653 transitions. [2024-10-14 10:07:27,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:07:27,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-10-14 10:07:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:27,009 INFO L225 Difference]: With dead ends: 1662 [2024-10-14 10:07:27,009 INFO L226 Difference]: Without dead ends: 1222 [2024-10-14 10:07:27,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:07:27,011 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 418 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:27,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 561 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 10:07:27,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2024-10-14 10:07:27,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1208. [2024-10-14 10:07:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 907 states have (on average 1.496141124586549) internal successors, (1357), 915 states have internal predecessors, (1357), 286 states have call successors, (286), 14 states have call predecessors, (286), 14 states have return successors, (286), 278 states have call predecessors, (286), 286 states have call successors, (286) [2024-10-14 10:07:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1929 transitions. [2024-10-14 10:07:27,090 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1929 transitions. Word has length 210 [2024-10-14 10:07:27,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:27,091 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1929 transitions. [2024-10-14 10:07:27,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1929 transitions. [2024-10-14 10:07:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 10:07:27,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:27,093 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:27,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:07:27,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:27,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:27,097 INFO L85 PathProgramCache]: Analyzing trace with hash 648116822, now seen corresponding path program 1 times [2024-10-14 10:07:27,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:27,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658464835] [2024-10-14 10:07:27,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:27,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:07:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:07:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:07:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 10:07:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:07:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:07:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:07:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 10:07:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:07:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:07:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:07:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:07:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:07:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:07:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:07:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:07:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:07:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:07:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:07:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:07:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:07:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:07:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:07:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:07:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:07:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:07:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:07:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:07:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:07:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:07:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:07:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:07:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:07:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:07:27,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:07:27,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658464835] [2024-10-14 10:07:27,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658464835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:07:27,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:07:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:07:27,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670772241] [2024-10-14 10:07:27,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:07:27,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:07:27,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:07:27,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:07:27,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:07:27,529 INFO L87 Difference]: Start difference. First operand 1208 states and 1929 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:28,053 INFO L93 Difference]: Finished difference Result 1756 states and 2789 transitions. [2024-10-14 10:07:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:07:28,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-10-14 10:07:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:28,059 INFO L225 Difference]: With dead ends: 1756 [2024-10-14 10:07:28,060 INFO L226 Difference]: Without dead ends: 1535 [2024-10-14 10:07:28,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:07:28,061 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 317 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:28,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 688 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 10:07:28,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-10-14 10:07:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1516. [2024-10-14 10:07:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1164 states have (on average 1.5051546391752577) internal successors, (1752), 1177 states have internal predecessors, (1752), 332 states have call successors, (332), 19 states have call predecessors, (332), 19 states have return successors, (332), 319 states have call predecessors, (332), 332 states have call successors, (332) [2024-10-14 10:07:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2416 transitions. [2024-10-14 10:07:28,145 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2416 transitions. Word has length 210 [2024-10-14 10:07:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:28,145 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 2416 transitions. [2024-10-14 10:07:28,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2416 transitions. [2024-10-14 10:07:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 10:07:28,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:28,147 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:28,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:07:28,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:28,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:28,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1030290854, now seen corresponding path program 1 times [2024-10-14 10:07:28,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:28,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62775356] [2024-10-14 10:07:28,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:28,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:07:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:07:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:07:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 10:07:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:07:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:07:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:07:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 10:07:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:07:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:07:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:07:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:07:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:07:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:07:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:07:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:07:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:07:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:07:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:07:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:07:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:07:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:07:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:07:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:07:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:07:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:07:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:07:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:07:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:07:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:07:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:07:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:07:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:07:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:07:28,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:07:28,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62775356] [2024-10-14 10:07:28,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62775356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:07:28,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:07:28,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:07:28,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897820641] [2024-10-14 10:07:28,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:07:28,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:07:28,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:07:28,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:07:28,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:07:28,408 INFO L87 Difference]: Start difference. First operand 1516 states and 2416 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:28,522 INFO L93 Difference]: Finished difference Result 2537 states and 4043 transitions. [2024-10-14 10:07:28,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:07:28,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-10-14 10:07:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:28,529 INFO L225 Difference]: With dead ends: 2537 [2024-10-14 10:07:28,529 INFO L226 Difference]: Without dead ends: 1022 [2024-10-14 10:07:28,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-14 10:07:28,534 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 118 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:28,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 306 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:07:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2024-10-14 10:07:28,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1020. [2024-10-14 10:07:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 784 states have (on average 1.4808673469387754) internal successors, (1161), 793 states have internal predecessors, (1161), 222 states have call successors, (222), 13 states have call predecessors, (222), 13 states have return successors, (222), 213 states have call predecessors, (222), 222 states have call successors, (222) [2024-10-14 10:07:28,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1605 transitions. [2024-10-14 10:07:28,589 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1605 transitions. Word has length 210 [2024-10-14 10:07:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:28,589 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1605 transitions. [2024-10-14 10:07:28,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1605 transitions. [2024-10-14 10:07:28,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-14 10:07:28,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:28,591 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:28,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 10:07:28,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:28,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:28,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1727259607, now seen corresponding path program 1 times [2024-10-14 10:07:28,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:28,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878045179] [2024-10-14 10:07:28,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:28,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:07:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:07:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:07:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 10:07:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:07:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:07:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:07:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 10:07:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:07:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:07:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:07:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:07:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:07:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:07:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:07:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:07:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:07:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:07:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:07:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:07:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:07:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:07:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:07:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:07:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:07:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:07:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:07:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:07:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:07:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:07:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:07:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:07:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:07:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:07:28,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:07:28,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878045179] [2024-10-14 10:07:28,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878045179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:07:28,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:07:28,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:07:28,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924282193] [2024-10-14 10:07:28,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:07:28,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:07:28,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:07:28,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:07:28,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:07:28,819 INFO L87 Difference]: Start difference. First operand 1020 states and 1605 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:28,959 INFO L93 Difference]: Finished difference Result 1757 states and 2775 transitions. [2024-10-14 10:07:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:07:28,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2024-10-14 10:07:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:28,963 INFO L225 Difference]: With dead ends: 1757 [2024-10-14 10:07:28,963 INFO L226 Difference]: Without dead ends: 738 [2024-10-14 10:07:28,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:07:28,966 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 139 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:28,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 516 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:07:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-10-14 10:07:28,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 655. [2024-10-14 10:07:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 501 states have (on average 1.4890219560878244) internal successors, (746), 506 states have internal predecessors, (746), 145 states have call successors, (145), 8 states have call predecessors, (145), 8 states have return successors, (145), 140 states have call predecessors, (145), 145 states have call successors, (145) [2024-10-14 10:07:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1036 transitions. [2024-10-14 10:07:29,000 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1036 transitions. Word has length 212 [2024-10-14 10:07:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:29,001 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1036 transitions. [2024-10-14 10:07:29,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1036 transitions. [2024-10-14 10:07:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-14 10:07:29,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:29,003 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:29,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 10:07:29,003 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:29,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:29,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1980901675, now seen corresponding path program 1 times [2024-10-14 10:07:29,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:29,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69092768] [2024-10-14 10:07:29,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:29,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:07:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:07:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:07:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 10:07:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:07:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:07:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:07:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 10:07:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:07:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:07:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:07:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:07:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:07:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:07:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:07:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:07:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:07:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:07:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:07:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:07:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:07:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:07:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:07:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:07:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:07:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:07:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:07:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:07:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:07:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:07:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:07:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:07:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:07:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:07:29,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:07:29,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69092768] [2024-10-14 10:07:29,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69092768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:07:29,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:07:29,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 10:07:29,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068291989] [2024-10-14 10:07:29,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:07:29,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:07:29,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:07:29,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:07:29,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:07:29,727 INFO L87 Difference]: Start difference. First operand 655 states and 1036 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 10:07:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:30,678 INFO L93 Difference]: Finished difference Result 1374 states and 2165 transitions. [2024-10-14 10:07:30,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 10:07:30,679 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 212 [2024-10-14 10:07:30,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:30,683 INFO L225 Difference]: With dead ends: 1374 [2024-10-14 10:07:30,683 INFO L226 Difference]: Without dead ends: 827 [2024-10-14 10:07:30,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-14 10:07:30,685 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 332 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:30,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 676 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 10:07:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-10-14 10:07:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 803. [2024-10-14 10:07:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 625 states have (on average 1.4816) internal successors, (926), 632 states have internal predecessors, (926), 165 states have call successors, (165), 12 states have call predecessors, (165), 12 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-14 10:07:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1256 transitions. [2024-10-14 10:07:30,740 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1256 transitions. Word has length 212 [2024-10-14 10:07:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:30,741 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1256 transitions. [2024-10-14 10:07:30,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 10:07:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1256 transitions. [2024-10-14 10:07:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-14 10:07:30,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:30,743 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:30,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 10:07:30,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:30,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1872857671, now seen corresponding path program 1 times [2024-10-14 10:07:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:30,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209896733] [2024-10-14 10:07:30,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:07:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:07:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:07:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 10:07:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:07:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:07:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:07:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 10:07:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:07:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:07:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:07:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:07:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:07:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:07:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:07:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:07:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:07:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:07:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:07:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:07:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:07:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:07:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:07:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:07:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:07:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:07:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:07:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:07:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:07:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:07:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:07:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:07:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:07:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:07:30,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:07:30,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209896733] [2024-10-14 10:07:30,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209896733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:07:30,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:07:30,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:07:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517453574] [2024-10-14 10:07:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:07:30,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:07:30,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:07:30,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:07:30,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:07:30,865 INFO L87 Difference]: Start difference. First operand 803 states and 1256 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:30,956 INFO L93 Difference]: Finished difference Result 2027 states and 3175 transitions. [2024-10-14 10:07:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:07:30,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2024-10-14 10:07:30,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:30,964 INFO L225 Difference]: With dead ends: 2027 [2024-10-14 10:07:30,964 INFO L226 Difference]: Without dead ends: 1408 [2024-10-14 10:07:30,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-14 10:07:30,967 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 170 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:30,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 339 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:07:30,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-10-14 10:07:31,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 902. [2024-10-14 10:07:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 724 states have (on average 1.4986187845303867) internal successors, (1085), 731 states have internal predecessors, (1085), 165 states have call successors, (165), 12 states have call predecessors, (165), 12 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-14 10:07:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1415 transitions. [2024-10-14 10:07:31,033 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1415 transitions. Word has length 213 [2024-10-14 10:07:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:31,034 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1415 transitions. [2024-10-14 10:07:31,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1415 transitions. [2024-10-14 10:07:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-14 10:07:31,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:31,036 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:31,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 10:07:31,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:31,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1192799301, now seen corresponding path program 1 times [2024-10-14 10:07:31,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:31,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427569357] [2024-10-14 10:07:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:31,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:07:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:07:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:07:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 10:07:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:07:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:07:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:07:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 10:07:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:07:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:07:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:07:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:07:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:07:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:07:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:07:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:07:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:07:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:07:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:07:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:07:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:07:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:07:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:07:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:07:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:07:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:07:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:07:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:07:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:07:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:07:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:07:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:07:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:07:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-14 10:07:31,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:07:31,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427569357] [2024-10-14 10:07:31,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427569357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:07:31,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728200195] [2024-10-14 10:07:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:31,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:07:31,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:07:31,295 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-14 10:07:31,295 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-14 10:07:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:31,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 10:07:31,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:07:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 848 proven. 24 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2024-10-14 10:07:31,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:07:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-14 10:07:31,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728200195] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:07:31,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 10:07:31,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-14 10:07:31,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116518286] [2024-10-14 10:07:31,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 10:07:31,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 10:07:31,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:07:31,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 10:07:31,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:07:31,775 INFO L87 Difference]: Start difference. First operand 902 states and 1415 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-14 10:07:32,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:32,005 INFO L93 Difference]: Finished difference Result 1685 states and 2627 transitions. [2024-10-14 10:07:32,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 10:07:32,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 213 [2024-10-14 10:07:32,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:32,010 INFO L225 Difference]: With dead ends: 1685 [2024-10-14 10:07:32,010 INFO L226 Difference]: Without dead ends: 920 [2024-10-14 10:07:32,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 487 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-14 10:07:32,014 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 215 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:32,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 346 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:07:32,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-14 10:07:32,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 914. [2024-10-14 10:07:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 733 states have (on average 1.4624829467939973) internal successors, (1072), 740 states have internal predecessors, (1072), 165 states have call successors, (165), 15 states have call predecessors, (165), 15 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-14 10:07:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1402 transitions. [2024-10-14 10:07:32,097 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1402 transitions. Word has length 213 [2024-10-14 10:07:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:32,098 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1402 transitions. [2024-10-14 10:07:32,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-14 10:07:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1402 transitions. [2024-10-14 10:07:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-14 10:07:32,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:32,100 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:32,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 10:07:32,300 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-14 10:07:32,301 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:32,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash -496144441, now seen corresponding path program 1 times [2024-10-14 10:07:32,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:32,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646194291] [2024-10-14 10:07:32,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:32,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:07:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:07:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:07:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 10:07:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:07:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:07:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:07:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 10:07:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:07:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:07:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:07:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:07:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:07:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:07:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:07:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:07:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:07:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:07:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:07:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:07:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:07:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:07:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:07:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:07:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:07:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:07:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:07:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:07:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:07:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:07:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:07:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:07:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:07:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-14 10:07:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:07:32,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646194291] [2024-10-14 10:07:32,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646194291] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:07:32,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940038227] [2024-10-14 10:07:32,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:32,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:07:32,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:07:32,895 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-14 10:07:32,896 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-14 10:07:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:33,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 10:07:33,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:07:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2024-10-14 10:07:33,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:07:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-14 10:07:34,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940038227] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:07:34,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 10:07:34,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 10] total 23 [2024-10-14 10:07:34,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051037665] [2024-10-14 10:07:34,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 10:07:34,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 10:07:34,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:07:34,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 10:07:34,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2024-10-14 10:07:34,297 INFO L87 Difference]: Start difference. First operand 914 states and 1402 transitions. Second operand has 23 states, 22 states have (on average 5.2727272727272725) internal successors, (116), 23 states have internal predecessors, (116), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 7 states have call successors, (99) [2024-10-14 10:07:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:37,284 INFO L93 Difference]: Finished difference Result 3393 states and 5243 transitions. [2024-10-14 10:07:37,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-14 10:07:37,285 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.2727272727272725) internal successors, (116), 23 states have internal predecessors, (116), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 7 states have call successors, (99) Word has length 213 [2024-10-14 10:07:37,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:37,295 INFO L225 Difference]: With dead ends: 3393 [2024-10-14 10:07:37,295 INFO L226 Difference]: Without dead ends: 2589 [2024-10-14 10:07:37,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=643, Invalid=2437, Unknown=0, NotChecked=0, Total=3080 [2024-10-14 10:07:37,299 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1708 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1777 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 3032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:37,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1777 Valid, 1487 Invalid, 3032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 10:07:37,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2024-10-14 10:07:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 1166. [2024-10-14 10:07:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 931 states have (on average 1.4736842105263157) internal successors, (1372), 940 states have internal predecessors, (1372), 214 states have call successors, (214), 20 states have call predecessors, (214), 20 states have return successors, (214), 205 states have call predecessors, (214), 214 states have call successors, (214) [2024-10-14 10:07:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1800 transitions. [2024-10-14 10:07:37,434 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1800 transitions. Word has length 213 [2024-10-14 10:07:37,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:37,435 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 1800 transitions. [2024-10-14 10:07:37,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.2727272727272725) internal successors, (116), 23 states have internal predecessors, (116), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 7 states have call successors, (99) [2024-10-14 10:07:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1800 transitions. [2024-10-14 10:07:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-14 10:07:37,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:37,437 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:37,451 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-14 10:07:37,641 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-14 10:07:37,642 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:37,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:37,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1017129163, now seen corresponding path program 1 times [2024-10-14 10:07:37,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:37,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875559083] [2024-10-14 10:07:37,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:37,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:07:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 10:07:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 10:07:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 10:07:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 10:07:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 10:07:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 10:07:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 10:07:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 10:07:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 10:07:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 10:07:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:07:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:07:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:07:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:07:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:07:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:07:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:07:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 10:07:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:37,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 10:07:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 10:07:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 10:07:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 10:07:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 10:07:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 10:07:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 10:07:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 10:07:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:07:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 10:07:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:07:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 10:07:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:07:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:07:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 57 proven. 39 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-14 10:07:38,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:07:38,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875559083] [2024-10-14 10:07:38,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875559083] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:07:38,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051700981] [2024-10-14 10:07:38,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:38,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:07:38,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:07:38,054 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-14 10:07:38,057 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-14 10:07:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:38,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 10:07:38,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:07:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1058 proven. 39 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-10-14 10:07:38,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:07:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 57 proven. 39 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-14 10:07:38,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051700981] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:07:38,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 10:07:38,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-14 10:07:38,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51420221] [2024-10-14 10:07:38,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 10:07:38,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 10:07:38,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:07:38,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 10:07:38,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 10:07:38,468 INFO L87 Difference]: Start difference. First operand 1166 states and 1800 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-10-14 10:07:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:38,945 INFO L93 Difference]: Finished difference Result 2097 states and 3223 transitions. [2024-10-14 10:07:38,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 10:07:38,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 216 [2024-10-14 10:07:38,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:38,951 INFO L225 Difference]: With dead ends: 2097 [2024-10-14 10:07:38,951 INFO L226 Difference]: Without dead ends: 1069 [2024-10-14 10:07:38,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 493 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-14 10:07:38,954 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 213 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:38,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 621 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:07:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2024-10-14 10:07:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1050. [2024-10-14 10:07:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 811 states have (on average 1.409371146732429) internal successors, (1143), 820 states have internal predecessors, (1143), 214 states have call successors, (214), 24 states have call predecessors, (214), 24 states have return successors, (214), 205 states have call predecessors, (214), 214 states have call successors, (214) [2024-10-14 10:07:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1571 transitions. [2024-10-14 10:07:39,059 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1571 transitions. Word has length 216 [2024-10-14 10:07:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:39,060 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1571 transitions. [2024-10-14 10:07:39,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-10-14 10:07:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1571 transitions. [2024-10-14 10:07:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-14 10:07:39,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:39,062 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:39,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 10:07:39,262 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-14 10:07:39,263 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:39,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash 624102153, now seen corresponding path program 1 times [2024-10-14 10:07:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:07:39,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116990448] [2024-10-14 10:07:39,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:39,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:07:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:07:39,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315217818] [2024-10-14 10:07:39,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:39,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:07:39,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:07:39,366 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-14 10:07:39,367 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-14 10:07:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:07:39,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:07:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:07:39,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:07:39,745 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:07:39,746 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:07:39,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 10:07:39,948 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-14 10:07:39,951 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:07:40,066 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:07:40,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:07:40 BoogieIcfgContainer [2024-10-14 10:07:40,069 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:07:40,069 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:07:40,069 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:07:40,069 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:07:40,069 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:24" (3/4) ... [2024-10-14 10:07:40,071 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:07:40,072 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:07:40,073 INFO L158 Benchmark]: Toolchain (without parser) took 16615.96ms. Allocated memory was 192.9MB in the beginning and 482.3MB in the end (delta: 289.4MB). Free memory was 134.5MB in the beginning and 167.8MB in the end (delta: -33.3MB). Peak memory consumption was 254.6MB. Max. memory is 16.1GB. [2024-10-14 10:07:40,073 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:07:40,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.51ms. Allocated memory is still 192.9MB. Free memory was 133.9MB in the beginning and 161.0MB in the end (delta: -27.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 10:07:40,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.34ms. Allocated memory is still 192.9MB. Free memory was 161.0MB in the beginning and 156.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 10:07:40,073 INFO L158 Benchmark]: Boogie Preprocessor took 60.67ms. Allocated memory is still 192.9MB. Free memory was 156.8MB in the beginning and 153.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 10:07:40,074 INFO L158 Benchmark]: RCFGBuilder took 545.74ms. Allocated memory is still 192.9MB. Free memory was 153.6MB in the beginning and 120.1MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 10:07:40,074 INFO L158 Benchmark]: TraceAbstraction took 15633.90ms. Allocated memory was 192.9MB in the beginning and 482.3MB in the end (delta: 289.4MB). Free memory was 120.1MB in the beginning and 167.8MB in the end (delta: -47.7MB). Peak memory consumption was 243.8MB. Max. memory is 16.1GB. [2024-10-14 10:07:40,074 INFO L158 Benchmark]: Witness Printer took 3.33ms. Allocated memory is still 482.3MB. Free memory is still 167.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:07:40,075 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.13ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.51ms. Allocated memory is still 192.9MB. Free memory was 133.9MB in the beginning and 161.0MB in the end (delta: -27.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.34ms. Allocated memory is still 192.9MB. Free memory was 161.0MB in the beginning and 156.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.67ms. Allocated memory is still 192.9MB. Free memory was 156.8MB in the beginning and 153.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 545.74ms. Allocated memory is still 192.9MB. Free memory was 153.6MB in the beginning and 120.1MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15633.90ms. Allocated memory was 192.9MB in the beginning and 482.3MB in the end (delta: 289.4MB). Free memory was 120.1MB in the beginning and 167.8MB in the end (delta: -47.7MB). Peak memory consumption was 243.8MB. Max. memory is 16.1GB. * Witness Printer took 3.33ms. Allocated memory is still 482.3MB. Free memory is still 167.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 202, overapproximation of bitwiseOr at line 66, overapproximation of someBinaryArithmeticDOUBLEoperation at line 136. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] double var_1_4 = 10.5; [L24] double var_1_5 = 1.55; [L25] signed char var_1_8 = -10; [L26] signed char var_1_10 = -16; [L27] signed char var_1_11 = -4; [L28] signed char var_1_12 = -16; [L29] double var_1_13 = 128.55; [L30] double var_1_14 = 2.3; [L31] double var_1_15 = 4.8; [L32] unsigned long int var_1_16 = 0; [L33] signed long int var_1_17 = 5; [L34] signed long int var_1_18 = 256; [L35] unsigned long int var_1_19 = 50; [L36] unsigned long int var_1_20 = 1; [L37] signed short int var_1_21 = -50; [L38] unsigned char var_1_23 = 1; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_28 = 0; [L42] unsigned char var_1_29 = 0; [L43] unsigned char var_1_30 = 1; [L44] unsigned long int var_1_31 = 200; [L45] unsigned char var_1_35 = 32; [L46] unsigned char var_1_36 = 10; [L47] double var_1_37 = 15.5; [L48] signed long int var_1_39 = -10; [L49] unsigned long int var_1_42 = 10000; [L50] unsigned long int var_1_43 = 4251471014; [L51] signed short int var_1_44 = 64; [L52] unsigned char var_1_45 = 1; [L53] unsigned long int var_1_46 = 25; [L54] signed long int var_1_47 = -50; [L55] unsigned char var_1_48 = 0; [L56] double var_1_49 = 16.5; [L57] signed char last_1_var_1_8 = -10; [L58] signed short int last_1_var_1_21 = -50; [L59] unsigned char last_1_var_1_23 = 1; [L206] isInitial = 1 [L207] FCALL initially() [L208] COND TRUE 1 [L209] CALL updateLastVariables() [L197] last_1_var_1_8 = var_1_8 [L198] last_1_var_1_21 = var_1_21 [L199] last_1_var_1_23 = var_1_23 [L209] RET updateLastVariables() [L210] CALL updateVariables() [L144] var_1_4 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L145] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L146] var_1_5 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L147] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L148] var_1_10 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L149] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L150] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L150] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L151] var_1_11 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_11 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L152] RET assume_abort_if_not(var_1_11 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L153] CALL assume_abort_if_not(var_1_11 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L153] RET assume_abort_if_not(var_1_11 <= 32) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L154] var_1_12 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L155] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L156] CALL assume_abort_if_not(var_1_12 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L156] RET assume_abort_if_not(var_1_12 <= 31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L157] var_1_14 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L158] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L159] var_1_15 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L160] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L161] var_1_17 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L162] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L163] CALL assume_abort_if_not(var_1_17 <= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L163] RET assume_abort_if_not(var_1_17 <= 1073741824) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L164] var_1_18 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L165] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L166] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L166] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L167] var_1_19 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L168] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L169] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L169] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L170] var_1_20 = __VERIFIER_nondet_ulong() [L171] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L171] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L172] CALL assume_abort_if_not(var_1_20 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L172] RET assume_abort_if_not(var_1_20 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L173] var_1_24 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L174] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L175] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L175] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L176] var_1_28 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L177] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L178] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L178] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L179] var_1_29 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L180] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L181] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L181] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L182] var_1_30 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L183] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L184] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L184] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L185] var_1_36 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L186] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L187] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L187] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L188] var_1_43 = __VERIFIER_nondet_ulong() [L189] CALL assume_abort_if_not(var_1_43 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L189] RET assume_abort_if_not(var_1_43 >= 3221225470) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L190] CALL assume_abort_if_not(var_1_43 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L190] RET assume_abort_if_not(var_1_43 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L191] var_1_45 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L192] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L193] CALL assume_abort_if_not(var_1_45 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L193] RET assume_abort_if_not(var_1_45 <= 255) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L194] CALL assume_abort_if_not(var_1_45 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L194] RET assume_abort_if_not(var_1_45 != 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L210] RET updateVariables() [L211] CALL step() [L63] COND FALSE !(32 >= var_1_18) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR 16u | var_1_8 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR (((16u | var_1_8)) > (var_1_18)) ? ((16u | var_1_8)) : (var_1_18) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR 16u | var_1_8 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR (((16u | var_1_8)) > (var_1_18)) ? ((16u | var_1_8)) : (var_1_18) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] COND FALSE !(var_1_19 > (((((16u | var_1_8)) > (var_1_18)) ? ((16u | var_1_8)) : (var_1_18)))) [L71] EXPR var_1_17 & -10 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L71] COND FALSE !((var_1_17 & -10) < var_1_19) [L80] var_1_37 = var_1_5 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L81] COND FALSE !(! var_1_30) [L84] var_1_39 = (var_1_16 + ((((var_1_36) > ((var_1_8 + var_1_12))) ? (var_1_36) : ((var_1_8 + var_1_12))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L86] var_1_42 = ((var_1_43 - var_1_36) - var_1_21) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=64, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L87] COND TRUE (var_1_18 / var_1_45) > ((((var_1_36) < 0 ) ? -(var_1_36) : (var_1_36))) [L88] var_1_44 = ((((var_1_45) < ((((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) < 0 ) ? -((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) : ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) ? (var_1_45) : ((((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) < 0 ) ? -((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) : ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L92] var_1_46 = var_1_43 [L93] var_1_47 = var_1_8 [L94] var_1_48 = var_1_30 [L95] var_1_49 = var_1_15 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-10] [L96] COND TRUE last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-10] [L97] COND TRUE \read(last_1_var_1_23) [L98] var_1_8 = (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L103] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L104] COND FALSE !(128u >= var_1_8) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L111] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L115] COND TRUE var_1_8 >= ((1329162249 - var_1_17) - var_1_18) [L116] var_1_16 = (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L124] COND FALSE !(((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L133] unsigned char stepLocal_1 = var_1_23; [L134] signed char stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_0=-1, stepLocal_1=0, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L135] COND TRUE stepLocal_0 >= var_1_16 [L136] var_1_1 = (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_1=0, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L211] RET step() [L212] CALL, EXPR property() [L202] EXPR (((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L202-L203] return ((((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1)) && (var_1_23 == ((unsigned char) var_1_24)) ; [L212] RET, EXPR property() [L212] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=7, var_1_12=8, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1395663361, var_1_19=0, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=-4098, var_1_37=2, var_1_39=254, var_1_42=3221225266, var_1_43=3221225470, var_1_44=10, var_1_45=42, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 12, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4141 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4028 mSDsluCounter, 6406 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4370 mSDsCounter, 1064 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5014 IncrementalHoareTripleChecker+Invalid, 6078 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1064 mSolverCounterUnsat, 2036 mSDtfsCounter, 5014 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2130 GetRequests, 2014 SyntacticMatches, 6 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1516occurred in iteration=4, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 2129 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 3402 NumberOfCodeBlocks, 3402 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3595 ConstructedInterpolants, 0 QuantifiedInterpolants, 13429 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1470 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 35535/35904 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-14 10:07:40,131 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-ps-ci_file-24.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 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:07:41,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:07:42,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:07:42,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:07:42,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:07:42,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:07:42,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:07:42,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:07:42,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:07:42,062 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:07:42,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:07:42,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:07:42,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:07:42,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:07:42,063 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:07:42,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:07:42,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:07:42,066 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:07:42,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:07:42,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:07:42,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:07:42,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:07:42,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:07:42,067 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:07:42,067 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:07:42,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:07:42,068 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:07:42,068 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:07:42,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:07:42,068 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:07:42,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:07:42,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:07:42,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:07:42,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:07:42,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:07:42,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:07:42,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:07:42,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:07:42,070 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:07:42,070 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:07:42,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:07:42,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:07:42,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:07:42,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:07:42,072 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:07:42,072 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 -> 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 [2024-10-14 10:07:42,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:07:42,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:07:42,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:07:42,352 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:07:42,353 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:07:42,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-10-14 10:07:43,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:07:43,781 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:07:43,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-10-14 10:07:43,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d798a8f/a158eecf44ac4956995a6e460b636142/FLAG25078b4c7 [2024-10-14 10:07:44,161 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d798a8f/a158eecf44ac4956995a6e460b636142 [2024-10-14 10:07:44,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:07:44,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:07:44,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:07:44,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:07:44,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:07:44,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:44" (1/1) ... [2024-10-14 10:07:44,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@149e3ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44, skipping insertion in model container [2024-10-14 10:07:44,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:44" (1/1) ... [2024-10-14 10:07:44,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:07:44,332 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-ps-ci_file-24.i[919,932] [2024-10-14 10:07:44,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:07:44,426 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:07:44,437 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-ps-ci_file-24.i[919,932] [2024-10-14 10:07:44,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:07:44,503 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:07:44,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44 WrapperNode [2024-10-14 10:07:44,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:07:44,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:07:44,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:07:44,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:07:44,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44" (1/1) ... [2024-10-14 10:07:44,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44" (1/1) ... [2024-10-14 10:07:44,550 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-10-14 10:07:44,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:07:44,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:07:44,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:07:44,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:07:44,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44" (1/1) ... [2024-10-14 10:07:44,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44" (1/1) ... [2024-10-14 10:07:44,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44" (1/1) ... [2024-10-14 10:07:44,583 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-14 10:07:44,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44" (1/1) ... [2024-10-14 10:07:44,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44" (1/1) ... [2024-10-14 10:07:44,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44" (1/1) ... [2024-10-14 10:07:44,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44" (1/1) ... [2024-10-14 10:07:44,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44" (1/1) ... [2024-10-14 10:07:44,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44" (1/1) ... [2024-10-14 10:07:44,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:07:44,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:07:44,622 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:07:44,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:07:44,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44" (1/1) ... [2024-10-14 10:07:44,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:07:44,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:07:44,648 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-14 10:07:44,650 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-14 10:07:44,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:07:44,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:07:44,684 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:07:44,684 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:07:44,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:07:44,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:07:44,772 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:07:44,774 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:07:47,150 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 10:07:47,150 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:07:47,193 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:07:47,196 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:07:47,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:47 BoogieIcfgContainer [2024-10-14 10:07:47,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:07:47,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:07:47,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:07:47,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:07:47,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:07:44" (1/3) ... [2024-10-14 10:07:47,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b96c1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:47, skipping insertion in model container [2024-10-14 10:07:47,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:44" (2/3) ... [2024-10-14 10:07:47,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b96c1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:47, skipping insertion in model container [2024-10-14 10:07:47,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:47" (3/3) ... [2024-10-14 10:07:47,205 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-10-14 10:07:47,224 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:07:47,224 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:07:47,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:07:47,274 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;@693cb16c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:07:47,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:07:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 10:07:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 10:07:47,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:47,291 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:47,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:47,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:47,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2048442452, now seen corresponding path program 1 times [2024-10-14 10:07:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:07:47,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140419095] [2024-10-14 10:07:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:47,305 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-14 10:07:47,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:07:47,308 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-14 10:07:47,309 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-14 10:07:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:47,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:07:47,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:07:47,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2024-10-14 10:07:47,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:07:47,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:07:47,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140419095] [2024-10-14 10:07:47,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140419095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:07:47,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:07:47,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:07:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412552925] [2024-10-14 10:07:47,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:07:47,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:07:47,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:07:47,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:07:47,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:07:47,750 INFO L87 Difference]: Start difference. First operand has 90 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 10:07:48,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:07:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:48,927 INFO L93 Difference]: Finished difference Result 176 states and 321 transitions. [2024-10-14 10:07:48,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:07:48,948 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2024-10-14 10:07:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:48,954 INFO L225 Difference]: With dead ends: 176 [2024-10-14 10:07:48,955 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 10:07:48,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 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-14 10:07:48,959 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:48,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 10:07:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 10:07:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-14 10:07:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 10:07:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 138 transitions. [2024-10-14 10:07:49,001 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 138 transitions. Word has length 204 [2024-10-14 10:07:49,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:49,002 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 138 transitions. [2024-10-14 10:07:49,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 10:07:49,003 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 138 transitions. [2024-10-14 10:07:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 10:07:49,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:49,007 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:49,019 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-14 10:07:49,208 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-14 10:07:49,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:49,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:49,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1488514898, now seen corresponding path program 1 times [2024-10-14 10:07:49,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:07:49,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089415768] [2024-10-14 10:07:49,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:49,210 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-14 10:07:49,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:07:49,214 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-14 10:07:49,215 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-14 10:07:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:49,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 10:07:49,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:07:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 848 proven. 24 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2024-10-14 10:07:49,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:07:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-14 10:07:50,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:07:50,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089415768] [2024-10-14 10:07:50,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089415768] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:07:50,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 10:07:50,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-14 10:07:50,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233669005] [2024-10-14 10:07:50,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 10:07:50,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 10:07:50,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:07:50,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 10:07:50,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:07:50,264 INFO L87 Difference]: Start difference. First operand 87 states and 138 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-14 10:07:51,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:07:51,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:51,872 INFO L93 Difference]: Finished difference Result 179 states and 280 transitions. [2024-10-14 10:07:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 10:07:51,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 204 [2024-10-14 10:07:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:51,895 INFO L225 Difference]: With dead ends: 179 [2024-10-14 10:07:51,895 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 10:07:51,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-14 10:07:51,896 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 141 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:51,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 222 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 10:07:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 10:07:51,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-10-14 10:07:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 10:07:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2024-10-14 10:07:51,918 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 204 [2024-10-14 10:07:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:51,919 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2024-10-14 10:07:51,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-14 10:07:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2024-10-14 10:07:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 10:07:51,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:51,922 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:51,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 10:07:52,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:07:52,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:52,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:52,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1526588720, now seen corresponding path program 1 times [2024-10-14 10:07:52,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:07:52,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122256485] [2024-10-14 10:07:52,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:52,124 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-14 10:07:52,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:07:52,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:07:52,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 10:07:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:52,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 10:07:52,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:07:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:07:53,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:07:53,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:07:53,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122256485] [2024-10-14 10:07:53,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122256485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:07:53,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:07:53,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:07:53,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948795013] [2024-10-14 10:07:53,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:07:53,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:07:53,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:07:53,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:07:53,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:07:53,754 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:55,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:07:56,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:07:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:07:56,509 INFO L93 Difference]: Finished difference Result 288 states and 444 transitions. [2024-10-14 10:07:56,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:07:56,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2024-10-14 10:07:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:07:56,531 INFO L225 Difference]: With dead ends: 288 [2024-10-14 10:07:56,531 INFO L226 Difference]: Without dead ends: 198 [2024-10-14 10:07:56,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:07:56,533 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 102 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 10:07:56,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 388 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 10:07:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-14 10:07:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 178. [2024-10-14 10:07:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 107 states have internal predecessors, (142), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:07:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 274 transitions. [2024-10-14 10:07:56,575 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 274 transitions. Word has length 204 [2024-10-14 10:07:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:07:56,576 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 274 transitions. [2024-10-14 10:07:56,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:07:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 274 transitions. [2024-10-14 10:07:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 10:07:56,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:07:56,579 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:07:56,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 10:07:56,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:07:56,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:07:56,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:07:56,781 INFO L85 PathProgramCache]: Analyzing trace with hash 274530804, now seen corresponding path program 1 times [2024-10-14 10:07:56,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:07:56,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946119937] [2024-10-14 10:07:56,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:07:56,782 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-14 10:07:56,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:07:56,784 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:07:56,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 10:07:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:07:57,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 10:07:57,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:07:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1058 proven. 39 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-10-14 10:07:57,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:07:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 57 proven. 39 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-14 10:07:57,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:07:57,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946119937] [2024-10-14 10:07:57,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946119937] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:07:57,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 10:07:57,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-14 10:07:57,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822072532] [2024-10-14 10:07:57,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 10:07:57,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 10:07:57,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:07:57,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 10:07:57,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 10:07:57,558 INFO L87 Difference]: Start difference. First operand 178 states and 274 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-10-14 10:08:00,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:08:01,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:01,189 INFO L93 Difference]: Finished difference Result 454 states and 681 transitions. [2024-10-14 10:08:01,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 10:08:01,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 205 [2024-10-14 10:08:01,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:01,193 INFO L225 Difference]: With dead ends: 454 [2024-10-14 10:08:01,193 INFO L226 Difference]: Without dead ends: 277 [2024-10-14 10:08:01,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-14 10:08:01,198 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 185 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:01,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 420 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-14 10:08:01,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-14 10:08:01,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 186. [2024-10-14 10:08:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 113 states have internal predecessors, (143), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:08:01,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 275 transitions. [2024-10-14 10:08:01,246 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 275 transitions. Word has length 205 [2024-10-14 10:08:01,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:01,247 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 275 transitions. [2024-10-14 10:08:01,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-10-14 10:08:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 275 transitions. [2024-10-14 10:08:01,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 10:08:01,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:01,249 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:08:01,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 10:08:01,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:08:01,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:01,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:01,450 INFO L85 PathProgramCache]: Analyzing trace with hash -534815822, now seen corresponding path program 1 times [2024-10-14 10:08:01,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:08:01,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259839100] [2024-10-14 10:08:01,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:01,451 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-14 10:08:01,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:08:01,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:08:01,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 10:08:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:01,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 10:08:01,749 INFO L278 TraceCheckSpWp]: Computing forward predicates...