./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.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 b17426fcbd3c87a5dd89cb5e1501daf40166b5a166256cea7242083b05c82ceb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:11:29,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:11:29,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:11:29,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:11:29,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:11:29,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:11:29,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:11:29,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:11:29,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:11:29,971 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:11:29,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:11:29,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:11:29,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:11:29,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:11:29,975 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:11:29,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:11:29,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:11:29,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:11:29,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:11:29,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:11:29,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:11:29,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:11:29,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:11:29,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:11:29,986 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:11:29,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:11:29,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:11:29,987 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:11:29,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:11:29,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:11:29,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:11:29,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:11:29,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:11:29,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:11:29,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:11:29,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:11:29,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:11:29,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:11:29,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:11:29,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:11:29,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:11:29,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:11:29,990 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 -> b17426fcbd3c87a5dd89cb5e1501daf40166b5a166256cea7242083b05c82ceb [2024-11-10 08:11:30,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:11:30,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:11:30,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:11:30,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:11:30,247 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:11:30,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i [2024-11-10 08:11:31,588 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:11:31,787 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:11:31,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i [2024-11-10 08:11:31,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c05cd5cf/a2c8e5ae94c74ce3b795cdd2d565d135/FLAGbc4b2169d [2024-11-10 08:11:31,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c05cd5cf/a2c8e5ae94c74ce3b795cdd2d565d135 [2024-11-10 08:11:31,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:11:31,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:11:31,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:11:31,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:11:31,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:11:31,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:11:31" (1/1) ... [2024-11-10 08:11:31,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747cdd9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:31, skipping insertion in model container [2024-11-10 08:11:31,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:11:31" (1/1) ... [2024-11-10 08:11:31,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:11:32,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i[916,929] [2024-11-10 08:11:32,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:11:32,129 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:11:32,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i[916,929] [2024-11-10 08:11:32,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:11:32,201 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:11:32,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:32 WrapperNode [2024-11-10 08:11:32,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:11:32,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:11:32,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:11:32,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:11:32,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:32" (1/1) ... [2024-11-10 08:11:32,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:32" (1/1) ... [2024-11-10 08:11:32,258 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2024-11-10 08:11:32,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:11:32,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:11:32,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:11:32,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:11:32,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:32" (1/1) ... [2024-11-10 08:11:32,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:32" (1/1) ... [2024-11-10 08:11:32,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:32" (1/1) ... [2024-11-10 08:11:32,303 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:11:32,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:32" (1/1) ... [2024-11-10 08:11:32,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:32" (1/1) ... [2024-11-10 08:11:32,317 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:32" (1/1) ... [2024-11-10 08:11:32,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:32" (1/1) ... [2024-11-10 08:11:32,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:32" (1/1) ... [2024-11-10 08:11:32,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:32" (1/1) ... [2024-11-10 08:11:32,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:11:32,325 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:11:32,325 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:11:32,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:11:32,326 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:32" (1/1) ... [2024-11-10 08:11:32,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:11:32,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:11:32,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:11:32,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:11:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:11:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:11:32,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:11:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:11:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:11:32,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:11:32,513 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:11:32,515 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:11:32,905 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~ite19#1;havoc property_#t~bitwise18#1;havoc property_#t~short20#1; [2024-11-10 08:11:32,939 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-10 08:11:32,939 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:11:32,958 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:11:32,958 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:11:32,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:11:32 BoogieIcfgContainer [2024-11-10 08:11:32,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:11:32,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:11:32,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:11:32,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:11:32,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:11:31" (1/3) ... [2024-11-10 08:11:32,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6716c210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:11:32, skipping insertion in model container [2024-11-10 08:11:32,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:32" (2/3) ... [2024-11-10 08:11:32,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6716c210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:11:32, skipping insertion in model container [2024-11-10 08:11:32,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:11:32" (3/3) ... [2024-11-10 08:11:32,969 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-66.i [2024-11-10 08:11:32,983 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:11:32,984 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:11:33,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:11:33,042 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;@1fc31ee8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:11:33,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:11:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 70 states have internal predecessors, (100), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 08:11:33,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 08:11:33,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:33,057 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:33,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:33,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash -329538236, now seen corresponding path program 1 times [2024-11-10 08:11:33,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:33,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798591766] [2024-11-10 08:11:33,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:33,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:11:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:11:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:11:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:11:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:11:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:11:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:11:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:11:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:11:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:11:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:11:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:11:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:11:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:11:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:11:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:11:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:11:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:11:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:11:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:11:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 08:11:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 08:11:33,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:11:33,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798591766] [2024-11-10 08:11:33,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798591766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:11:33,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:11:33,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:11:33,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732487877] [2024-11-10 08:11:33,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:11:33,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:11:33,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:33,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:11:33,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:11:33,513 INFO L87 Difference]: Start difference. First operand has 93 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 70 states have internal predecessors, (100), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 08:11:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:33,544 INFO L93 Difference]: Finished difference Result 178 states and 298 transitions. [2024-11-10 08:11:33,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:11:33,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 151 [2024-11-10 08:11:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:33,554 INFO L225 Difference]: With dead ends: 178 [2024-11-10 08:11:33,554 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 08:11:33,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:11:33,561 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:33,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:11:33,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 08:11:33,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-10 08:11:33,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 states have internal predecessors, (92), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 08:11:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 134 transitions. [2024-11-10 08:11:33,607 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 134 transitions. Word has length 151 [2024-11-10 08:11:33,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:33,608 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 134 transitions. [2024-11-10 08:11:33,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 08:11:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 134 transitions. [2024-11-10 08:11:33,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 08:11:33,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:33,617 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:33,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:11:33,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:33,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:33,618 INFO L85 PathProgramCache]: Analyzing trace with hash -28849023, now seen corresponding path program 1 times [2024-11-10 08:11:33,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:33,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805016679] [2024-11-10 08:11:33,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:33,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:11:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:11:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:11:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:11:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:11:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:11:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:11:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:11:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:11:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:11:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:11:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:11:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:11:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:11:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:11:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:11:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:11:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:11:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:11:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:11:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 08:11:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 08:11:33,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:11:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805016679] [2024-11-10 08:11:33,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805016679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:11:33,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:11:33,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:11:33,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202110493] [2024-11-10 08:11:33,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:11:33,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:11:33,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:33,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:11:33,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:11:33,923 INFO L87 Difference]: Start difference. First operand 88 states and 134 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 08:11:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:33,994 INFO L93 Difference]: Finished difference Result 214 states and 327 transitions. [2024-11-10 08:11:33,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:11:33,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 151 [2024-11-10 08:11:33,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:34,000 INFO L225 Difference]: With dead ends: 214 [2024-11-10 08:11:34,000 INFO L226 Difference]: Without dead ends: 129 [2024-11-10 08:11:34,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:11:34,002 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 59 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:34,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 305 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:11:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-10 08:11:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 90. [2024-11-10 08:11:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 67 states have internal predecessors, (93), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 08:11:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 135 transitions. [2024-11-10 08:11:34,014 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 135 transitions. Word has length 151 [2024-11-10 08:11:34,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:34,017 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 135 transitions. [2024-11-10 08:11:34,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 08:11:34,017 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 135 transitions. [2024-11-10 08:11:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 08:11:34,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:34,019 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:34,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:11:34,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:34,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:34,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2106058366, now seen corresponding path program 1 times [2024-11-10 08:11:34,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:34,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133751143] [2024-11-10 08:11:34,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:34,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:11:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:11:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:11:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:11:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:11:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:11:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:11:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:11:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:11:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:11:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:11:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:11:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:11:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:11:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:11:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:11:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:11:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:11:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:11:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:11:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 08:11:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-10 08:11:34,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:11:34,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133751143] [2024-11-10 08:11:34,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133751143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:11:34,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20403395] [2024-11-10 08:11:34,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:34,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:34,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:11:34,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:11:34,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 08:11:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:34,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 08:11:34,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:11:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 08:11:35,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:11:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-10 08:11:35,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20403395] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:11:35,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:11:35,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-10 08:11:35,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554597965] [2024-11-10 08:11:35,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:11:35,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 08:11:35,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:35,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 08:11:35,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:11:35,466 INFO L87 Difference]: Start difference. First operand 90 states and 135 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2024-11-10 08:11:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:35,718 INFO L93 Difference]: Finished difference Result 183 states and 272 transitions. [2024-11-10 08:11:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:11:35,720 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) Word has length 151 [2024-11-10 08:11:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:35,722 INFO L225 Difference]: With dead ends: 183 [2024-11-10 08:11:35,722 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 08:11:35,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:11:35,726 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 261 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:35,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 423 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:11:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 08:11:35,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2024-11-10 08:11:35,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 08:11:35,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2024-11-10 08:11:35,748 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 151 [2024-11-10 08:11:35,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:35,749 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2024-11-10 08:11:35,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2024-11-10 08:11:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2024-11-10 08:11:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 08:11:35,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:35,757 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:35,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 08:11:35,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:35,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:35,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1780084705, now seen corresponding path program 1 times [2024-11-10 08:11:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:35,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464720590] [2024-11-10 08:11:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:35,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:11:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:11:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:11:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:11:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:11:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:11:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:11:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:11:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:11:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:11:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:11:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:11:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:11:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:11:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:11:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:11:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:11:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:11:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:11:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:11:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 08:11:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 08:11:36,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:11:36,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464720590] [2024-11-10 08:11:36,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464720590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:11:36,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:11:36,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:11:36,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967630604] [2024-11-10 08:11:36,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:11:36,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:11:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:36,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:11:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:11:36,293 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 08:11:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:36,319 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2024-11-10 08:11:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:11:36,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 151 [2024-11-10 08:11:36,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:36,321 INFO L225 Difference]: With dead ends: 185 [2024-11-10 08:11:36,321 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 08:11:36,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:11:36,323 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:36,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 119 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:11:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 08:11:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 08:11:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 70 states have internal predecessors, (92), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 08:11:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-11-10 08:11:36,338 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 151 [2024-11-10 08:11:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:36,338 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-11-10 08:11:36,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 08:11:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-11-10 08:11:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 08:11:36,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:36,341 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:36,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:11:36,341 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:36,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1078012575, now seen corresponding path program 1 times [2024-11-10 08:11:36,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:36,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595374262] [2024-11-10 08:11:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:11:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:11:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:11:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:11:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:11:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:11:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:11:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:11:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:11:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:11:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:11:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:11:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:11:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:11:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:11:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:11:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:11:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:11:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:11:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:11:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 08:11:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 08:11:36,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:11:36,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595374262] [2024-11-10 08:11:36,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595374262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:11:36,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:11:36,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:11:36,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972502888] [2024-11-10 08:11:36,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:11:36,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:11:36,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:36,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:11:36,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:11:36,640 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 08:11:36,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:36,682 INFO L93 Difference]: Finished difference Result 185 states and 265 transitions. [2024-11-10 08:11:36,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:11:36,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 151 [2024-11-10 08:11:36,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:36,687 INFO L225 Difference]: With dead ends: 185 [2024-11-10 08:11:36,687 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 08:11:36,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:11:36,690 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 70 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:36,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 233 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:11:36,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 08:11:36,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 08:11:36,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 08:11:36,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2024-11-10 08:11:36,701 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 151 [2024-11-10 08:11:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:36,701 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2024-11-10 08:11:36,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 08:11:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2024-11-10 08:11:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 08:11:36,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:36,703 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:36,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 08:11:36,704 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:36,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:36,704 INFO L85 PathProgramCache]: Analyzing trace with hash -944521126, now seen corresponding path program 1 times [2024-11-10 08:11:36,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:36,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083355315] [2024-11-10 08:11:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:11:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:11:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:11:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:11:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:11:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:11:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:11:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:11:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:11:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:11:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:11:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:11:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:11:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:11:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:11:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:11:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:11:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:11:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:11:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:11:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 08:11:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-10 08:11:37,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:11:37,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083355315] [2024-11-10 08:11:37,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083355315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:11:37,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954506259] [2024-11-10 08:11:37,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:37,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:37,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:11:37,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:11:37,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 08:11:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:37,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 08:11:37,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:11:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 284 proven. 48 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-11-10 08:11:37,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:11:37,935 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-10 08:11:37,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954506259] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:11:37,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:11:37,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2024-11-10 08:11:37,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113287382] [2024-11-10 08:11:37,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:11:37,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 08:11:37,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:37,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 08:11:37,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-11-10 08:11:37,938 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2024-11-10 08:11:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:42,804 INFO L93 Difference]: Finished difference Result 1305 states and 1690 transitions. [2024-11-10 08:11:42,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2024-11-10 08:11:42,804 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) Word has length 153 [2024-11-10 08:11:42,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:42,814 INFO L225 Difference]: With dead ends: 1305 [2024-11-10 08:11:42,815 INFO L226 Difference]: Without dead ends: 1214 [2024-11-10 08:11:42,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11879 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4191, Invalid=23865, Unknown=0, NotChecked=0, Total=28056 [2024-11-10 08:11:42,827 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 2177 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 1831 mSolverCounterSat, 932 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 932 IncrementalHoareTripleChecker+Valid, 1831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:42,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 1826 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [932 Valid, 1831 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 08:11:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2024-11-10 08:11:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 795. [2024-11-10 08:11:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 609 states have (on average 1.2183908045977012) internal successors, (742), 620 states have internal predecessors, (742), 144 states have call successors, (144), 41 states have call predecessors, (144), 41 states have return successors, (144), 133 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-10 08:11:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1030 transitions. [2024-11-10 08:11:42,961 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1030 transitions. Word has length 153 [2024-11-10 08:11:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:42,962 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1030 transitions. [2024-11-10 08:11:42,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2024-11-10 08:11:42,963 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1030 transitions. [2024-11-10 08:11:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 08:11:42,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:42,965 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:42,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 08:11:43,165 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,SelfDestructingSolverStorable5 [2024-11-10 08:11:43,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:43,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:43,167 INFO L85 PathProgramCache]: Analyzing trace with hash 477967108, now seen corresponding path program 1 times [2024-11-10 08:11:43,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:43,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203262661] [2024-11-10 08:11:43,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:43,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:11:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:11:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:11:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:11:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:11:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:11:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:11:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:11:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:11:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:11:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:11:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:11:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:11:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:11:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:11:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:11:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:11:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:11:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:11:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:11:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 08:11:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 08:11:43,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:11:43,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203262661] [2024-11-10 08:11:43,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203262661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:11:43,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:11:43,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:11:43,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668551176] [2024-11-10 08:11:43,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:11:43,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:11:43,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:43,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:11:43,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:11:43,338 INFO L87 Difference]: Start difference. First operand 795 states and 1030 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 08:11:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:43,687 INFO L93 Difference]: Finished difference Result 2860 states and 3674 transitions. [2024-11-10 08:11:43,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:11:43,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 154 [2024-11-10 08:11:43,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:43,700 INFO L225 Difference]: With dead ends: 2860 [2024-11-10 08:11:43,700 INFO L226 Difference]: Without dead ends: 2068 [2024-11-10 08:11:43,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:11:43,703 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 392 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:43,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 742 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:11:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2024-11-10 08:11:43,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1390. [2024-11-10 08:11:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1074 states have (on average 1.2104283054003724) internal successors, (1300), 1094 states have internal predecessors, (1300), 244 states have call successors, (244), 71 states have call predecessors, (244), 71 states have return successors, (244), 224 states have call predecessors, (244), 244 states have call successors, (244) [2024-11-10 08:11:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1788 transitions. [2024-11-10 08:11:43,830 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1788 transitions. Word has length 154 [2024-11-10 08:11:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:43,831 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1788 transitions. [2024-11-10 08:11:43,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 08:11:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1788 transitions. [2024-11-10 08:11:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 08:11:43,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:43,832 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:43,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 08:11:43,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:43,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:43,833 INFO L85 PathProgramCache]: Analyzing trace with hash 474463281, now seen corresponding path program 1 times [2024-11-10 08:11:43,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:43,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418151652] [2024-11-10 08:11:43,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:43,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:11:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:11:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:11:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:11:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:11:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:11:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:11:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:11:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:11:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:11:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:11:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:11:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:11:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:11:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:11:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:11:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:11:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:11:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:11:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:11:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 08:11:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-10 08:11:44,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:11:44,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418151652] [2024-11-10 08:11:44,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418151652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:11:44,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710922515] [2024-11-10 08:11:44,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:44,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:44,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:11:44,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:11:44,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 08:11:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:44,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 08:11:44,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:11:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 134 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 08:11:45,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:11:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-10 08:11:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710922515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:11:45,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:11:45,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 18 [2024-11-10 08:11:45,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616442160] [2024-11-10 08:11:45,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:11:45,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 08:11:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:45,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 08:11:45,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-10 08:11:45,684 INFO L87 Difference]: Start difference. First operand 1390 states and 1788 transitions. Second operand has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2024-11-10 08:11:46,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:46,639 INFO L93 Difference]: Finished difference Result 5315 states and 6932 transitions. [2024-11-10 08:11:46,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 08:11:46,640 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) Word has length 154 [2024-11-10 08:11:46,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:46,656 INFO L225 Difference]: With dead ends: 5315 [2024-11-10 08:11:46,657 INFO L226 Difference]: Without dead ends: 3928 [2024-11-10 08:11:46,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2024-11-10 08:11:46,664 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 303 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:46,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 888 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 08:11:46,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states. [2024-11-10 08:11:46,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 2811. [2024-11-10 08:11:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2811 states, 2170 states have (on average 1.2027649769585254) internal successors, (2610), 2210 states have internal predecessors, (2610), 488 states have call successors, (488), 152 states have call predecessors, (488), 152 states have return successors, (488), 448 states have call predecessors, (488), 488 states have call successors, (488) [2024-11-10 08:11:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2811 states and 3586 transitions. [2024-11-10 08:11:46,945 INFO L78 Accepts]: Start accepts. Automaton has 2811 states and 3586 transitions. Word has length 154 [2024-11-10 08:11:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:46,948 INFO L471 AbstractCegarLoop]: Abstraction has 2811 states and 3586 transitions. [2024-11-10 08:11:46,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2024-11-10 08:11:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2811 states and 3586 transitions. [2024-11-10 08:11:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 08:11:46,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:46,951 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:46,967 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-11-10 08:11:47,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:47,152 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:47,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash 685814194, now seen corresponding path program 1 times [2024-11-10 08:11:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:47,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747285701] [2024-11-10 08:11:47,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:47,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:11:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:11:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:11:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:11:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:11:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:11:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:11:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:11:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:11:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:11:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:11:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:11:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:11:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:11:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:11:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:11:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:11:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:11:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:11:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:11:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 08:11:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 15 proven. 99 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-11-10 08:11:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:11:47,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747285701] [2024-11-10 08:11:47,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747285701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:11:47,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314654684] [2024-11-10 08:11:47,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:47,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:47,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:11:47,886 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-11-10 08:11:47,887 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-11-10 08:11:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:48,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 08:11:48,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:11:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 234 proven. 180 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-10 08:11:49,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:11:50,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314654684] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:11:50,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 08:11:50,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 27 [2024-11-10 08:11:50,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280126520] [2024-11-10 08:11:50,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 08:11:50,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 08:11:50,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:50,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 08:11:50,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1357, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 08:11:50,165 INFO L87 Difference]: Start difference. First operand 2811 states and 3586 transitions. Second operand has 27 states, 26 states have (on average 3.923076923076923) internal successors, (102), 24 states have internal predecessors, (102), 8 states have call successors, (42), 6 states have call predecessors, (42), 8 states have return successors, (42), 7 states have call predecessors, (42), 8 states have call successors, (42) [2024-11-10 08:11:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:53,390 INFO L93 Difference]: Finished difference Result 7417 states and 9464 transitions. [2024-11-10 08:11:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-10 08:11:53,391 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.923076923076923) internal successors, (102), 24 states have internal predecessors, (102), 8 states have call successors, (42), 6 states have call predecessors, (42), 8 states have return successors, (42), 7 states have call predecessors, (42), 8 states have call successors, (42) Word has length 154 [2024-11-10 08:11:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:53,411 INFO L225 Difference]: With dead ends: 7417 [2024-11-10 08:11:53,411 INFO L226 Difference]: Without dead ends: 4609 [2024-11-10 08:11:53,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2834 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2252, Invalid=8878, Unknown=0, NotChecked=0, Total=11130 [2024-11-10 08:11:53,421 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1359 mSDsluCounter, 2677 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 2892 SdHoareTripleChecker+Invalid, 2200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:53,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 2892 Invalid, 2200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 08:11:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2024-11-10 08:11:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4212. [2024-11-10 08:11:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4212 states, 3235 states have (on average 1.2139103554868624) internal successors, (3927), 3283 states have internal predecessors, (3927), 752 states have call successors, (752), 224 states have call predecessors, (752), 224 states have return successors, (752), 704 states have call predecessors, (752), 752 states have call successors, (752) [2024-11-10 08:11:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4212 states to 4212 states and 5431 transitions. [2024-11-10 08:11:53,848 INFO L78 Accepts]: Start accepts. Automaton has 4212 states and 5431 transitions. Word has length 154 [2024-11-10 08:11:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:53,849 INFO L471 AbstractCegarLoop]: Abstraction has 4212 states and 5431 transitions. [2024-11-10 08:11:53,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.923076923076923) internal successors, (102), 24 states have internal predecessors, (102), 8 states have call successors, (42), 6 states have call predecessors, (42), 8 states have return successors, (42), 7 states have call predecessors, (42), 8 states have call successors, (42) [2024-11-10 08:11:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4212 states and 5431 transitions. [2024-11-10 08:11:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 08:11:53,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:53,852 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:53,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 08:11:54,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:54,053 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:54,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:54,054 INFO L85 PathProgramCache]: Analyzing trace with hash -113147438, now seen corresponding path program 1 times [2024-11-10 08:11:54,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:54,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799670865] [2024-11-10 08:11:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:54,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:11:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:11:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:11:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:11:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:11:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:11:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:11:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:11:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:11:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:11:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:11:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:11:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:11:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 08:11:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:11:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:11:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:11:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:11:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:11:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:11:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 08:11:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-10 08:11:54,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:11:54,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799670865] [2024-11-10 08:11:54,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799670865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:11:54,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292461164] [2024-11-10 08:11:54,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:54,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:54,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:11:54,423 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:11:54,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 08:11:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:54,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 08:11:54,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:11:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-10 08:11:54,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:11:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-10 08:11:54,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292461164] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:11:54,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:11:54,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-10 08:11:54,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801200175] [2024-11-10 08:11:54,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:11:54,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 08:11:54,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:54,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 08:11:54,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:11:54,908 INFO L87 Difference]: Start difference. First operand 4212 states and 5431 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-11-10 08:11:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:55,334 INFO L93 Difference]: Finished difference Result 8661 states and 11127 transitions. [2024-11-10 08:11:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:11:55,334 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 154 [2024-11-10 08:11:55,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:55,355 INFO L225 Difference]: With dead ends: 8661 [2024-11-10 08:11:55,356 INFO L226 Difference]: Without dead ends: 4452 [2024-11-10 08:11:55,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:11:55,368 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 63 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:55,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 419 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:11:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4452 states. [2024-11-10 08:11:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4452 to 4212. [2024-11-10 08:11:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4212 states, 3235 states have (on average 1.1941267387944359) internal successors, (3863), 3283 states have internal predecessors, (3863), 752 states have call successors, (752), 224 states have call predecessors, (752), 224 states have return successors, (752), 704 states have call predecessors, (752), 752 states have call successors, (752) [2024-11-10 08:11:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4212 states to 4212 states and 5367 transitions. [2024-11-10 08:11:55,733 INFO L78 Accepts]: Start accepts. Automaton has 4212 states and 5367 transitions. Word has length 154 [2024-11-10 08:11:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:55,734 INFO L471 AbstractCegarLoop]: Abstraction has 4212 states and 5367 transitions. [2024-11-10 08:11:55,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-11-10 08:11:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4212 states and 5367 transitions. [2024-11-10 08:11:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 08:11:55,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:55,736 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:55,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 08:11:55,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 08:11:55,937 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:55,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:55,938 INFO L85 PathProgramCache]: Analyzing trace with hash -406550445, now seen corresponding path program 1 times [2024-11-10 08:11:55,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:55,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313135963] [2024-11-10 08:11:55,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:55,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 08:11:56,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [745769452] [2024-11-10 08:11:56,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:56,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:56,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:11:56,036 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:11:56,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 08:11:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:11:56,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:11:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:11:56,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:11:56,280 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:11:56,281 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:11:56,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 08:11:56,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:56,486 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:56,584 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:11:56,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:11:56 BoogieIcfgContainer [2024-11-10 08:11:56,586 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:11:56,587 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:11:56,587 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:11:56,587 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:11:56,588 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:11:32" (3/4) ... [2024-11-10 08:11:56,589 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:11:56,592 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:11:56,593 INFO L158 Benchmark]: Toolchain (without parser) took 24777.33ms. Allocated memory was 161.5MB in the beginning and 587.2MB in the end (delta: 425.7MB). Free memory was 104.5MB in the beginning and 324.3MB in the end (delta: -219.8MB). Peak memory consumption was 207.4MB. Max. memory is 16.1GB. [2024-11-10 08:11:56,593 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:11:56,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.16ms. Allocated memory is still 161.5MB. Free memory was 104.1MB in the beginning and 85.6MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 08:11:56,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.30ms. Allocated memory is still 161.5MB. Free memory was 85.6MB in the beginning and 81.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:11:56,594 INFO L158 Benchmark]: Boogie Preprocessor took 65.35ms. Allocated memory is still 161.5MB. Free memory was 81.0MB in the beginning and 74.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:11:56,594 INFO L158 Benchmark]: IcfgBuilder took 633.47ms. Allocated memory was 161.5MB in the beginning and 232.8MB in the end (delta: 71.3MB). Free memory was 74.7MB in the beginning and 183.3MB in the end (delta: -108.6MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-11-10 08:11:56,594 INFO L158 Benchmark]: TraceAbstraction took 23625.35ms. Allocated memory was 232.8MB in the beginning and 587.2MB in the end (delta: 354.4MB). Free memory was 183.3MB in the beginning and 324.3MB in the end (delta: -141.0MB). Peak memory consumption was 214.5MB. Max. memory is 16.1GB. [2024-11-10 08:11:56,595 INFO L158 Benchmark]: Witness Printer took 5.60ms. Allocated memory is still 587.2MB. Free memory is still 324.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:11:56,596 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.17ms. Allocated memory is still 161.5MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.16ms. Allocated memory is still 161.5MB. Free memory was 104.1MB in the beginning and 85.6MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.30ms. Allocated memory is still 161.5MB. Free memory was 85.6MB in the beginning and 81.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.35ms. Allocated memory is still 161.5MB. Free memory was 81.0MB in the beginning and 74.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 633.47ms. Allocated memory was 161.5MB in the beginning and 232.8MB in the end (delta: 71.3MB). Free memory was 74.7MB in the beginning and 183.3MB in the end (delta: -108.6MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23625.35ms. Allocated memory was 232.8MB in the beginning and 587.2MB in the end (delta: 354.4MB). Free memory was 183.3MB in the beginning and 324.3MB in the end (delta: -141.0MB). Peak memory consumption was 214.5MB. Max. memory is 16.1GB. * Witness Printer took 5.60ms. Allocated memory is still 587.2MB. Free memory is still 324.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 197, overapproximation of shiftLeft at line 144, overapproximation of someBinaryArithmeticDOUBLEoperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 197. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 64; [L23] unsigned short int var_1_5 = 63575; [L24] unsigned long int var_1_6 = 10; [L25] unsigned long int var_1_8 = 3366149252; [L26] signed long int var_1_9 = -10; [L27] signed long int var_1_11 = 1938698816; [L28] unsigned char var_1_12 = 5; [L29] unsigned char var_1_13 = 64; [L30] unsigned char var_1_14 = 64; [L31] double var_1_15 = 99.625; [L32] double var_1_16 = 0.0; [L33] double var_1_17 = 999.5; [L34] double var_1_18 = 9.35; [L35] float var_1_19 = 99.875; [L36] float var_1_20 = 10000.71; [L37] double var_1_21 = 1000.5; [L38] double var_1_23 = 15.25; [L39] signed long int var_1_24 = 8; [L40] unsigned short int var_1_25 = 32; [L41] signed short int var_1_26 = 2; [L42] unsigned char var_1_27 = 0; [L43] unsigned char var_1_28 = 0; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 1; [L46] unsigned char var_1_32 = 0; [L47] float var_1_33 = 64.75; [L48] float var_1_34 = 9.2; [L49] unsigned short int last_1_var_1_1 = 64; [L50] signed long int last_1_var_1_9 = -10; [L51] unsigned char last_1_var_1_12 = 5; [L52] signed long int last_1_var_1_24 = 8; [L53] unsigned short int last_1_var_1_25 = 32; [L54] unsigned char last_1_var_1_27 = 0; [L55] unsigned char last_1_var_1_29 = 0; VAL [isInitial=0, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=63575, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L201] isInitial = 1 [L202] FCALL initially() [L203] COND TRUE 1 [L204] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_9 = var_1_9 [L190] last_1_var_1_12 = var_1_12 [L191] last_1_var_1_24 = var_1_24 [L192] last_1_var_1_25 = var_1_25 [L193] last_1_var_1_27 = var_1_27 [L194] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=63575, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L204] RET updateLastVariables() [L205] CALL updateVariables() [L152] var_1_5 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L153] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L154] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L154] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L155] var_1_8 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_8 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L156] RET assume_abort_if_not(var_1_8 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L157] CALL assume_abort_if_not(var_1_8 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L157] RET assume_abort_if_not(var_1_8 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L158] var_1_11 = __VERIFIER_nondet_long() [L159] CALL assume_abort_if_not(var_1_11 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L159] RET assume_abort_if_not(var_1_11 >= 1073741822) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L160] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L160] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L161] var_1_13 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L162] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L163] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L163] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L164] var_1_14 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_14 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L165] RET assume_abort_if_not(var_1_14 >= 63) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L166] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L166] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L167] var_1_16 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L168] RET assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L169] var_1_17 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L170] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L171] var_1_18 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L172] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L173] var_1_20 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L174] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L175] var_1_28 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L176] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L177] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L177] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L178] var_1_30 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L179] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L180] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L180] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L181] var_1_32 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L182] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L183] CALL assume_abort_if_not(var_1_32 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L183] RET assume_abort_if_not(var_1_32 <= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L184] var_1_34 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L185] RET assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L205] RET updateVariables() [L206] CALL step() [L59] signed long int stepLocal_8 = 10000000; [L60] unsigned long int stepLocal_7 = 128u + last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_7=192, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L61] COND FALSE !(last_1_var_1_24 >= stepLocal_7) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L66] COND FALSE !(last_1_var_1_12 >= last_1_var_1_24) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L71] COND FALSE !(\read(last_1_var_1_29)) [L74] var_1_12 = (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=-10] [L76] COND FALSE !(\read(last_1_var_1_29)) [L83] var_1_9 = ((var_1_11 - 16) - last_1_var_1_24) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=1073741798] [L85] unsigned char stepLocal_4 = var_1_14; [L86] unsigned char stepLocal_3 = last_1_var_1_27; [L87] unsigned char stepLocal_2 = last_1_var_1_27; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_4=63, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=1073741798] [L88] COND TRUE (var_1_13 * (var_1_5 * last_1_var_1_9)) <= stepLocal_4 [L89] var_1_24 = 50 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=1073741798] [L99] var_1_15 = ((var_1_16 - var_1_17) - var_1_18) [L100] unsigned long int stepLocal_9 = 50u; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, stepLocal_9=50, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=1073741798] [L101] COND FALSE !(stepLocal_9 >= var_1_5) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=1073741798] [L104] unsigned char stepLocal_12 = var_1_26 > var_1_1; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_12=0, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=1073741798] [L105] COND FALSE !(var_1_32 || stepLocal_12) [L108] var_1_33 = var_1_16 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=1073741798] [L110] signed short int stepLocal_1 = var_1_26; [L111] signed long int stepLocal_0 = var_1_24; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_1=2, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=1073741798] [L112] COND FALSE !(stepLocal_1 >= (var_1_26 + (var_1_14 * 16))) [L117] var_1_21 = (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=1073741798] [L119] COND TRUE var_1_33 >= 0.25 [L120] var_1_19 = (var_1_17 + var_1_20) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=1073741798] [L122] COND FALSE !(\read(var_1_27)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=10, var_1_8=8589934590, var_1_9=1073741798] [L125] COND TRUE (var_1_33 * 8.2) < 10.4 [L126] var_1_6 = (var_1_8 - var_1_9) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=7516192792, var_1_8=8589934590, var_1_9=1073741798] [L128] signed long int stepLocal_6 = 0; [L129] unsigned long int stepLocal_5 = 25u; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_5=25, stepLocal_6=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=7516192792, var_1_8=8589934590, var_1_9=1073741798] [L130] COND FALSE !(stepLocal_6 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_5=25, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=7516192792, var_1_8=8589934590, var_1_9=1073741798] [L135] COND FALSE !(var_1_8 < stepLocal_5) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=7516192792, var_1_8=8589934590, var_1_9=1073741798] [L139] signed long int stepLocal_11 = (((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14)); [L140] unsigned char stepLocal_10 = var_1_27; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_10=0, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=7516192792, var_1_8=8589934590, var_1_9=1073741798] [L141] COND FALSE !(var_1_28 && stepLocal_10) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=7516192792, var_1_8=8589934590, var_1_9=1073741798] [L144] EXPR -25 << var_1_9 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=7516192792, var_1_8=8589934590, var_1_9=1073741798] [L144] COND TRUE stepLocal_11 > (-25 << var_1_9) [L145] var_1_29 = (var_1_27 || var_1_28) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=7516192792, var_1_8=8589934590, var_1_9=1073741798] [L206] RET step() [L207] CALL, EXPR property() [L197] EXPR (((((((((((((last_1_var_1_12 >= last_1_var_1_24) ? (last_1_var_1_29 ? (var_1_1 == ((unsigned short int) (var_1_5 - last_1_var_1_12))) : 1) : 1) && (((var_1_33 * 8.2) < 10.4) ? (var_1_6 == ((unsigned long int) (var_1_8 - var_1_9))) : 1)) && (last_1_var_1_29 ? (last_1_var_1_29 ? (var_1_9 == ((signed long int) (last_1_var_1_24 + 100))) : (var_1_9 == ((signed long int) (((((var_1_5 + last_1_var_1_24)) > (last_1_var_1_9)) ? ((var_1_5 + last_1_var_1_24)) : (last_1_var_1_9)))))) : (var_1_9 == ((signed long int) ((var_1_11 - 16) - last_1_var_1_24))))) && (last_1_var_1_29 ? (var_1_12 == ((unsigned char) (64 + var_1_13))) : (var_1_12 == ((unsigned char) (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))))))) && (var_1_15 == ((double) ((var_1_16 - var_1_17) - var_1_18)))) && ((var_1_33 >= 0.25) ? (var_1_19 == ((float) (var_1_17 + var_1_20))) : 1)) && ((var_1_26 >= (var_1_26 + (var_1_14 * 16))) ? ((-256 > var_1_24) ? (var_1_21 == ((double) var_1_17)) : 1) : (var_1_21 == ((double) (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)))))) && (var_1_27 ? (var_1_23 == ((double) ((((4.5) < 0 ) ? -(4.5) : (4.5))))) : 1)) && (((var_1_13 * (var_1_5 * last_1_var_1_9)) <= var_1_14) ? (var_1_24 == ((signed long int) 50)) : ((last_1_var_1_27 || last_1_var_1_27) ? ((last_1_var_1_27 || last_1_var_1_27) ? (var_1_24 == ((signed long int) last_1_var_1_12)) : 1) : (var_1_24 == ((signed long int) var_1_13))))) && ((0 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) ? (var_1_27 ? (var_1_25 == ((unsigned short int) (((((var_1_5 - var_1_9)) > ((var_1_12 + var_1_24))) ? ((var_1_5 - var_1_9)) : ((var_1_12 + var_1_24)))))) : 1) : ((var_1_8 < 25u) ? (var_1_25 == ((unsigned short int) var_1_6)) : 1))) && ((last_1_var_1_24 >= (128u + last_1_var_1_1)) ? ((10000000 != var_1_14) ? (var_1_26 == ((signed short int) last_1_var_1_25)) : 1) : 1)) && ((50u >= var_1_5) ? (var_1_27 == ((unsigned char) var_1_28)) : 1)) && ((var_1_28 && var_1_27) ? (var_1_29 == ((unsigned char) (var_1_28 && var_1_30))) : ((((((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14))) > (-25 << var_1_9)) ? (var_1_29 == ((unsigned char) (var_1_27 || var_1_28))) : (var_1_29 == ((unsigned char) ((var_1_23 <= ((((var_1_21) < (var_1_17)) ? (var_1_21) : (var_1_17)))) && var_1_32))))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=7516192792, var_1_8=8589934590, var_1_9=1073741798] [L197-L198] return ((((((((((((((last_1_var_1_12 >= last_1_var_1_24) ? (last_1_var_1_29 ? (var_1_1 == ((unsigned short int) (var_1_5 - last_1_var_1_12))) : 1) : 1) && (((var_1_33 * 8.2) < 10.4) ? (var_1_6 == ((unsigned long int) (var_1_8 - var_1_9))) : 1)) && (last_1_var_1_29 ? (last_1_var_1_29 ? (var_1_9 == ((signed long int) (last_1_var_1_24 + 100))) : (var_1_9 == ((signed long int) (((((var_1_5 + last_1_var_1_24)) > (last_1_var_1_9)) ? ((var_1_5 + last_1_var_1_24)) : (last_1_var_1_9)))))) : (var_1_9 == ((signed long int) ((var_1_11 - 16) - last_1_var_1_24))))) && (last_1_var_1_29 ? (var_1_12 == ((unsigned char) (64 + var_1_13))) : (var_1_12 == ((unsigned char) (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))))))) && (var_1_15 == ((double) ((var_1_16 - var_1_17) - var_1_18)))) && ((var_1_33 >= 0.25) ? (var_1_19 == ((float) (var_1_17 + var_1_20))) : 1)) && ((var_1_26 >= (var_1_26 + (var_1_14 * 16))) ? ((-256 > var_1_24) ? (var_1_21 == ((double) var_1_17)) : 1) : (var_1_21 == ((double) (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)))))) && (var_1_27 ? (var_1_23 == ((double) ((((4.5) < 0 ) ? -(4.5) : (4.5))))) : 1)) && (((var_1_13 * (var_1_5 * last_1_var_1_9)) <= var_1_14) ? (var_1_24 == ((signed long int) 50)) : ((last_1_var_1_27 || last_1_var_1_27) ? ((last_1_var_1_27 || last_1_var_1_27) ? (var_1_24 == ((signed long int) last_1_var_1_12)) : 1) : (var_1_24 == ((signed long int) var_1_13))))) && ((0 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) ? (var_1_27 ? (var_1_25 == ((unsigned short int) (((((var_1_5 - var_1_9)) > ((var_1_12 + var_1_24))) ? ((var_1_5 - var_1_9)) : ((var_1_12 + var_1_24)))))) : 1) : ((var_1_8 < 25u) ? (var_1_25 == ((unsigned short int) var_1_6)) : 1))) && ((last_1_var_1_24 >= (128u + last_1_var_1_1)) ? ((10000000 != var_1_14) ? (var_1_26 == ((signed short int) last_1_var_1_25)) : 1) : 1)) && ((50u >= var_1_5) ? (var_1_27 == ((unsigned char) var_1_28)) : 1)) && ((var_1_28 && var_1_27) ? (var_1_29 == ((unsigned char) (var_1_28 && var_1_30))) : ((((((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14))) > (-25 << var_1_9)) ? (var_1_29 == ((unsigned char) (var_1_27 || var_1_28))) : (var_1_29 == ((unsigned char) ((var_1_23 <= ((((var_1_21) < (var_1_17)) ? (var_1_21) : (var_1_17)))) && var_1_32)))))) && ((var_1_32 || (var_1_26 > var_1_1)) ? (var_1_33 == ((float) (((((var_1_20 + ((((var_1_17) > (var_1_34)) ? (var_1_17) : (var_1_34))))) < (var_1_16)) ? ((var_1_20 + ((((var_1_17) > (var_1_34)) ? (var_1_17) : (var_1_34))))) : (var_1_16))))) : (var_1_33 == ((float) var_1_16))) ; [L207] RET, EXPR property() [L207] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=7516192792, var_1_8=8589934590, var_1_9=1073741798] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=7516192792, var_1_8=8589934590, var_1_9=1073741798] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.5s, OverallIterations: 11, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4822 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4760 mSDsluCounter, 7979 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6439 mSDsCounter, 1275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5329 IncrementalHoareTripleChecker+Invalid, 6604 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1275 mSolverCounterUnsat, 1540 mSDtfsCounter, 5329 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2271 GetRequests, 1944 SyntacticMatches, 0 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14837 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4212occurred in iteration=9, InterpolantAutomatonStates: 276, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 2892 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 2598 NumberOfCodeBlocks, 2598 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2883 ConstructedInterpolants, 0 QuantifiedInterpolants, 12180 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1946 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 15180/15960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 08:11:56,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.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 b17426fcbd3c87a5dd89cb5e1501daf40166b5a166256cea7242083b05c82ceb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:11:58,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:11:58,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:11:58,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:11:58,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:11:58,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:11:58,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:11:58,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:11:58,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:11:58,756 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:11:58,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:11:58,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:11:58,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:11:58,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:11:58,757 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:11:58,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:11:58,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:11:58,758 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:11:58,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:11:58,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:11:58,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:11:58,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:11:58,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:11:58,759 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:11:58,760 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:11:58,760 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:11:58,760 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:11:58,760 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:11:58,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:11:58,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:11:58,761 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:11:58,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:11:58,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:11:58,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:11:58,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:11:58,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:11:58,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:11:58,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:11:58,763 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:11:58,763 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:11:58,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:11:58,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:11:58,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:11:58,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:11:58,764 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 -> b17426fcbd3c87a5dd89cb5e1501daf40166b5a166256cea7242083b05c82ceb [2024-11-10 08:11:59,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:11:59,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:11:59,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:11:59,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:11:59,051 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:11:59,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i [2024-11-10 08:12:00,439 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:12:00,634 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:12:00,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i [2024-11-10 08:12:00,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c133ea4c/cf8283bd872a4c05959011cbdc3a0f03/FLAG538de3463 [2024-11-10 08:12:01,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c133ea4c/cf8283bd872a4c05959011cbdc3a0f03 [2024-11-10 08:12:01,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:12:01,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:12:01,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:12:01,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:12:01,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:12:01,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:12:01" (1/1) ... [2024-11-10 08:12:01,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ea1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01, skipping insertion in model container [2024-11-10 08:12:01,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:12:01" (1/1) ... [2024-11-10 08:12:01,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:12:01,203 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i[916,929] [2024-11-10 08:12:01,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:12:01,324 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:12:01,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i[916,929] [2024-11-10 08:12:01,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:12:01,376 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:12:01,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01 WrapperNode [2024-11-10 08:12:01,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:12:01,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:12:01,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:12:01,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:12:01,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01" (1/1) ... [2024-11-10 08:12:01,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01" (1/1) ... [2024-11-10 08:12:01,425 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2024-11-10 08:12:01,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:12:01,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:12:01,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:12:01,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:12:01,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01" (1/1) ... [2024-11-10 08:12:01,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01" (1/1) ... [2024-11-10 08:12:01,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01" (1/1) ... [2024-11-10 08:12:01,458 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:12:01,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01" (1/1) ... [2024-11-10 08:12:01,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01" (1/1) ... [2024-11-10 08:12:01,480 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01" (1/1) ... [2024-11-10 08:12:01,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01" (1/1) ... [2024-11-10 08:12:01,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01" (1/1) ... [2024-11-10 08:12:01,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01" (1/1) ... [2024-11-10 08:12:01,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:12:01,493 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:12:01,493 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:12:01,493 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:12:01,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01" (1/1) ... [2024-11-10 08:12:01,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:12:01,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:12:01,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:12:01,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:12:01,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:12:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:12:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:12:01,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:12:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:12:01,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:12:01,670 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:12:01,673 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:12:17,288 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-10 08:12:17,289 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:12:17,302 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:12:17,302 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:12:17,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:12:17 BoogieIcfgContainer [2024-11-10 08:12:17,302 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:12:17,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:12:17,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:12:17,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:12:17,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:12:01" (1/3) ... [2024-11-10 08:12:17,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d0d97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:12:17, skipping insertion in model container [2024-11-10 08:12:17,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:12:01" (2/3) ... [2024-11-10 08:12:17,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d0d97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:12:17, skipping insertion in model container [2024-11-10 08:12:17,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:12:17" (3/3) ... [2024-11-10 08:12:17,311 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-66.i [2024-11-10 08:12:17,324 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:12:17,324 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:12:17,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:12:17,373 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;@72e8ae07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:12:17,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:12:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 08:12:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 08:12:17,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:12:17,386 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:12:17,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:12:17,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:12:17,390 INFO L85 PathProgramCache]: Analyzing trace with hash 838782462, now seen corresponding path program 1 times [2024-11-10 08:12:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:12:17,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576587005] [2024-11-10 08:12:17,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:12:17,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:12:17,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:12:17,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:12:17,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 08:12:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:12:18,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:12:18,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:12:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-10 08:12:18,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:12:18,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:12:18,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576587005] [2024-11-10 08:12:18,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576587005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:12:18,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:12:18,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:12:18,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45873446] [2024-11-10 08:12:18,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:12:18,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:12:18,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:12:18,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:12:18,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:12:18,152 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 08:12:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:12:18,179 INFO L93 Difference]: Finished difference Result 160 states and 272 transitions. [2024-11-10 08:12:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:12:18,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 149 [2024-11-10 08:12:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:12:18,186 INFO L225 Difference]: With dead ends: 160 [2024-11-10 08:12:18,186 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 08:12:18,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:12:18,191 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:12:18,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:12:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 08:12:18,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-10 08:12:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 08:12:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2024-11-10 08:12:18,224 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 149 [2024-11-10 08:12:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:12:18,224 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2024-11-10 08:12:18,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 08:12:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2024-11-10 08:12:18,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 08:12:18,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:12:18,228 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:12:18,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 08:12:18,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:12:18,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:12:18,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:12:18,430 INFO L85 PathProgramCache]: Analyzing trace with hash -27942789, now seen corresponding path program 1 times [2024-11-10 08:12:18,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:12:18,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677285004] [2024-11-10 08:12:18,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:12:18,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:12:18,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:12:18,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:12:18,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 08:12:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:12:19,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 08:12:19,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:12:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 08:12:21,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:12:21,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:12:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677285004] [2024-11-10 08:12:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677285004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:12:21,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:12:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:12:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343873192] [2024-11-10 08:12:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:12:21,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:12:21,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:12:21,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:12:21,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:12:21,865 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 08:12:26,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:12:30,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:12:34,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:12:38,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:12:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:12:38,874 INFO L93 Difference]: Finished difference Result 255 states and 397 transitions. [2024-11-10 08:12:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:12:38,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 149 [2024-11-10 08:12:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:12:38,969 INFO L225 Difference]: With dead ends: 255 [2024-11-10 08:12:38,970 INFO L226 Difference]: Without dead ends: 179 [2024-11-10 08:12:38,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:12:38,971 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 150 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 50 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-11-10 08:12:38,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 338 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 16.9s Time] [2024-11-10 08:12:38,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-10 08:12:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 126. [2024-11-10 08:12:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 08:12:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 191 transitions. [2024-11-10 08:12:39,001 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 191 transitions. Word has length 149 [2024-11-10 08:12:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:12:39,001 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 191 transitions. [2024-11-10 08:12:39,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 08:12:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 191 transitions. [2024-11-10 08:12:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 08:12:39,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:12:39,003 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:12:39,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 08:12:39,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:12:39,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:12:39,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:12:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1216821692, now seen corresponding path program 1 times [2024-11-10 08:12:39,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:12:39,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599183270] [2024-11-10 08:12:39,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:12:39,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:12:39,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:12:39,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:12:39,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 08:12:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:12:39,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 08:12:39,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:12:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 134 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 08:12:47,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:12:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-10 08:12:50,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:12:50,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599183270] [2024-11-10 08:12:50,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599183270] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:12:50,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 08:12:50,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2024-11-10 08:12:50,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263032784] [2024-11-10 08:12:50,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 08:12:50,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 08:12:50,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:12:50,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 08:12:50,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:12:50,971 INFO L87 Difference]: Start difference. First operand 126 states and 191 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42)