./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.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 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:46:58,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:46:58,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:46:58,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:46:58,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:46:58,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:46:58,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:46:58,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:46:58,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:46:58,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:46:58,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:46:58,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:46:58,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:46:58,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:46:58,660 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:46:58,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:46:58,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:46:58,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:46:58,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:46:58,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:46:58,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:46:58,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:46:58,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:46:58,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:46:58,663 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:46:58,663 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:46:58,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:46:58,664 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:46:58,664 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:46:58,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:46:58,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:46:58,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:46:58,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:46:58,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:46:58,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:46:58,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:46:58,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:46:58,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:46:58,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:46:58,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:46:58,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:46:58,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:46:58,669 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 -> 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 [2024-11-08 21:46:58,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:46:58,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:46:58,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:46:58,975 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:46:58,975 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:46:58,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-08 21:47:00,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:47:00,623 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:47:00,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-08 21:47:00,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca12dfeb/913f4b8dc204402cb299e1cc1efaf919/FLAG0697bd239 [2024-11-08 21:47:00,654 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca12dfeb/913f4b8dc204402cb299e1cc1efaf919 [2024-11-08 21:47:00,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:47:00,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:47:00,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:47:00,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:47:00,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:47:00,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:47:00" (1/1) ... [2024-11-08 21:47:00,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e25b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:00, skipping insertion in model container [2024-11-08 21:47:00,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:47:00" (1/1) ... [2024-11-08 21:47:00,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:47:00,898 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2024-11-08 21:47:00,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:47:01,006 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:47:01,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2024-11-08 21:47:01,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:47:01,091 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:47:01,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:01 WrapperNode [2024-11-08 21:47:01,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:47:01,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:47:01,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:47:01,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:47:01,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:01" (1/1) ... [2024-11-08 21:47:01,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:01" (1/1) ... [2024-11-08 21:47:01,149 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-11-08 21:47:01,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:47:01,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:47:01,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:47:01,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:47:01,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:01" (1/1) ... [2024-11-08 21:47:01,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:01" (1/1) ... [2024-11-08 21:47:01,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:01" (1/1) ... [2024-11-08 21:47:01,192 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-08 21:47:01,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:01" (1/1) ... [2024-11-08 21:47:01,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:01" (1/1) ... [2024-11-08 21:47:01,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:01" (1/1) ... [2024-11-08 21:47:01,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:01" (1/1) ... [2024-11-08 21:47:01,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:01" (1/1) ... [2024-11-08 21:47:01,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:01" (1/1) ... [2024-11-08 21:47:01,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:47:01,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:47:01,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:47:01,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:47:01,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:01" (1/1) ... [2024-11-08 21:47:01,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:47:01,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:01,267 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-08 21:47:01,277 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-08 21:47:01,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:47:01,326 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:47:01,328 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:47:01,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:47:01,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:47:01,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:47:01,441 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:47:01,443 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:47:01,920 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 21:47:01,922 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:47:01,942 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:47:01,943 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:47:01,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:01 BoogieIcfgContainer [2024-11-08 21:47:01,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:47:01,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:47:01,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:47:01,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:47:01,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:47:00" (1/3) ... [2024-11-08 21:47:01,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f6eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:47:01, skipping insertion in model container [2024-11-08 21:47:01,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:01" (2/3) ... [2024-11-08 21:47:01,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f6eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:47:01, skipping insertion in model container [2024-11-08 21:47:01,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:01" (3/3) ... [2024-11-08 21:47:01,956 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-08 21:47:01,973 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:47:01,973 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:47:02,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:47:02,047 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;@6be363a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:47:02,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:47:02,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 69 states have internal predecessors, (104), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 21:47:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 21:47:02,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:02,068 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:02,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:02,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:02,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1854159536, now seen corresponding path program 1 times [2024-11-08 21:47:02,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:02,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983212859] [2024-11-08 21:47:02,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:02,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:47:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:47:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:47:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:47:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:47:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:47:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:47:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:47:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:47:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:47:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:47:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:02,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:02,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983212859] [2024-11-08 21:47:02,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983212859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:02,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:02,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:47:02,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735672913] [2024-11-08 21:47:02,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:02,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:47:02,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:02,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:47:02,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:47:02,661 INFO L87 Difference]: Start difference. First operand has 90 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 69 states have internal predecessors, (104), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 21:47:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:02,694 INFO L93 Difference]: Finished difference Result 168 states and 289 transitions. [2024-11-08 21:47:02,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:47:02,697 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 137 [2024-11-08 21:47:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:02,706 INFO L225 Difference]: With dead ends: 168 [2024-11-08 21:47:02,706 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 21:47:02,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-08 21:47:02,717 INFO L432 NwaCegarLoop]: 124 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, 124 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-08 21:47:02,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:47:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 21:47:02,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 21:47:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 21:47:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2024-11-08 21:47:02,781 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 137 [2024-11-08 21:47:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:02,783 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2024-11-08 21:47:02,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 21:47:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2024-11-08 21:47:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 21:47:02,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:02,787 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:02,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:47:02,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:02,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:02,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1080617290, now seen corresponding path program 1 times [2024-11-08 21:47:02,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:02,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115389680] [2024-11-08 21:47:02,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:02,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:47:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:47:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:47:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:47:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:47:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:47:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:47:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:47:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:47:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:47:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:47:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:03,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:03,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115389680] [2024-11-08 21:47:03,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115389680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:03,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:03,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:47:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865856485] [2024-11-08 21:47:03,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:03,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:47:03,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:03,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:47:03,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:47:03,417 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:03,972 INFO L93 Difference]: Finished difference Result 342 states and 518 transitions. [2024-11-08 21:47:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 21:47:03,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-08 21:47:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:03,979 INFO L225 Difference]: With dead ends: 342 [2024-11-08 21:47:03,981 INFO L226 Difference]: Without dead ends: 264 [2024-11-08 21:47:03,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:47:03,984 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 299 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:03,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 341 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 21:47:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-08 21:47:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 255. [2024-11-08 21:47:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 190 states have (on average 1.4157894736842105) internal successors, (269), 192 states have internal predecessors, (269), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:47:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 389 transitions. [2024-11-08 21:47:04,052 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 389 transitions. Word has length 137 [2024-11-08 21:47:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:04,053 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 389 transitions. [2024-11-08 21:47:04,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 389 transitions. [2024-11-08 21:47:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 21:47:04,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:04,060 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:04,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:47:04,061 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:04,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:04,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1626002104, now seen corresponding path program 1 times [2024-11-08 21:47:04,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:04,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636143377] [2024-11-08 21:47:04,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:04,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:47:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:47:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:47:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:47:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:47:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:47:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:47:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:47:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:47:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:47:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:47:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:04,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:04,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636143377] [2024-11-08 21:47:04,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636143377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:04,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:04,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:47:04,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55382985] [2024-11-08 21:47:04,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:04,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:47:04,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:04,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:47:04,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:47:04,563 INFO L87 Difference]: Start difference. First operand 255 states and 389 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:04,958 INFO L93 Difference]: Finished difference Result 883 states and 1350 transitions. [2024-11-08 21:47:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:47:04,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-08 21:47:04,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:04,969 INFO L225 Difference]: With dead ends: 883 [2024-11-08 21:47:04,970 INFO L226 Difference]: Without dead ends: 631 [2024-11-08 21:47:04,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:47:04,975 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 266 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:04,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 302 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:47:04,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-08 21:47:05,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 627. [2024-11-08 21:47:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 466 states have (on average 1.4141630901287554) internal successors, (659), 471 states have internal predecessors, (659), 150 states have call successors, (150), 10 states have call predecessors, (150), 10 states have return successors, (150), 145 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-08 21:47:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 959 transitions. [2024-11-08 21:47:05,078 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 959 transitions. Word has length 137 [2024-11-08 21:47:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:05,079 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 959 transitions. [2024-11-08 21:47:05,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:05,080 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 959 transitions. [2024-11-08 21:47:05,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 21:47:05,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:05,087 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:05,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:47:05,087 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:05,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:05,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2048703930, now seen corresponding path program 1 times [2024-11-08 21:47:05,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:05,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465486898] [2024-11-08 21:47:05,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:05,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:47:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:47:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:47:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:47:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:47:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:47:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:47:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:47:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:47:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:47:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:47:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:05,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:05,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465486898] [2024-11-08 21:47:05,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465486898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:05,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:05,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:47:05,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434689658] [2024-11-08 21:47:05,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:05,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:47:05,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:05,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:47:05,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:47:05,335 INFO L87 Difference]: Start difference. First operand 627 states and 959 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:05,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:05,778 INFO L93 Difference]: Finished difference Result 1448 states and 2212 transitions. [2024-11-08 21:47:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:47:05,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-08 21:47:05,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:05,788 INFO L225 Difference]: With dead ends: 1448 [2024-11-08 21:47:05,789 INFO L226 Difference]: Without dead ends: 822 [2024-11-08 21:47:05,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:47:05,793 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 215 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:05,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 723 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 21:47:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-11-08 21:47:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 818. [2024-11-08 21:47:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 604 states have (on average 1.3973509933774835) internal successors, (844), 610 states have internal predecessors, (844), 199 states have call successors, (199), 14 states have call predecessors, (199), 14 states have return successors, (199), 193 states have call predecessors, (199), 199 states have call successors, (199) [2024-11-08 21:47:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1242 transitions. [2024-11-08 21:47:05,876 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1242 transitions. Word has length 137 [2024-11-08 21:47:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:05,877 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1242 transitions. [2024-11-08 21:47:05,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1242 transitions. [2024-11-08 21:47:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 21:47:05,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:05,880 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:05,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:47:05,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:05,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:05,881 INFO L85 PathProgramCache]: Analyzing trace with hash -517366854, now seen corresponding path program 1 times [2024-11-08 21:47:05,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:05,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366222688] [2024-11-08 21:47:05,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:05,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:47:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:47:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:47:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:47:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:47:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:47:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:47:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:47:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:47:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:47:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:47:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:06,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:06,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366222688] [2024-11-08 21:47:06,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366222688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:06,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:06,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:47:06,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352544228] [2024-11-08 21:47:06,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:06,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:47:06,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:06,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:47:06,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:47:06,155 INFO L87 Difference]: Start difference. First operand 818 states and 1242 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:06,527 INFO L93 Difference]: Finished difference Result 1564 states and 2365 transitions. [2024-11-08 21:47:06,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:47:06,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-08 21:47:06,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:06,535 INFO L225 Difference]: With dead ends: 1564 [2024-11-08 21:47:06,535 INFO L226 Difference]: Without dead ends: 880 [2024-11-08 21:47:06,538 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-08 21:47:06,539 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 249 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:06,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 226 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:47:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-11-08 21:47:06,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 697. [2024-11-08 21:47:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 515 states have (on average 1.396116504854369) internal successors, (719), 520 states have internal predecessors, (719), 169 states have call successors, (169), 12 states have call predecessors, (169), 12 states have return successors, (169), 164 states have call predecessors, (169), 169 states have call successors, (169) [2024-11-08 21:47:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1057 transitions. [2024-11-08 21:47:06,608 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1057 transitions. Word has length 137 [2024-11-08 21:47:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:06,609 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1057 transitions. [2024-11-08 21:47:06,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1057 transitions. [2024-11-08 21:47:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 21:47:06,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:06,611 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:06,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:47:06,611 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:06,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:06,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2105714756, now seen corresponding path program 1 times [2024-11-08 21:47:06,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:06,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588046134] [2024-11-08 21:47:06,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:06,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:06,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:47:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:47:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:47:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:47:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:47:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:47:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:47:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:47:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:47:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:47:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:47:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:07,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:07,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588046134] [2024-11-08 21:47:07,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588046134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:07,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:07,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:47:07,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029273709] [2024-11-08 21:47:07,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:07,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:47:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:07,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:47:07,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:47:07,124 INFO L87 Difference]: Start difference. First operand 697 states and 1057 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:07,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:07,549 INFO L93 Difference]: Finished difference Result 1515 states and 2294 transitions. [2024-11-08 21:47:07,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:47:07,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-08 21:47:07,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:07,556 INFO L225 Difference]: With dead ends: 1515 [2024-11-08 21:47:07,556 INFO L226 Difference]: Without dead ends: 821 [2024-11-08 21:47:07,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:47:07,560 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 346 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:07,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 418 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:47:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-08 21:47:07,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 697. [2024-11-08 21:47:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 515 states have (on average 1.3941747572815535) internal successors, (718), 520 states have internal predecessors, (718), 169 states have call successors, (169), 12 states have call predecessors, (169), 12 states have return successors, (169), 164 states have call predecessors, (169), 169 states have call successors, (169) [2024-11-08 21:47:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1056 transitions. [2024-11-08 21:47:07,624 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1056 transitions. Word has length 137 [2024-11-08 21:47:07,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:07,625 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1056 transitions. [2024-11-08 21:47:07,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1056 transitions. [2024-11-08 21:47:07,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 21:47:07,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:07,628 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:07,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:47:07,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:07,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash -288892625, now seen corresponding path program 1 times [2024-11-08 21:47:07,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:07,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281686082] [2024-11-08 21:47:07,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:07,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:47:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:47:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:47:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:47:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:47:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:47:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:47:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:47:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:47:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:47:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:47:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:07,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:07,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281686082] [2024-11-08 21:47:07,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281686082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:07,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:07,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:47:07,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934562067] [2024-11-08 21:47:07,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:07,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:47:07,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:07,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:47:07,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:47:07,859 INFO L87 Difference]: Start difference. First operand 697 states and 1056 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:08,232 INFO L93 Difference]: Finished difference Result 1541 states and 2332 transitions. [2024-11-08 21:47:08,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:47:08,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-08 21:47:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:08,238 INFO L225 Difference]: With dead ends: 1541 [2024-11-08 21:47:08,239 INFO L226 Difference]: Without dead ends: 847 [2024-11-08 21:47:08,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:47:08,242 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 293 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:08,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 316 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:47:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-11-08 21:47:08,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 834. [2024-11-08 21:47:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 610 states have (on average 1.383606557377049) internal successors, (844), 616 states have internal predecessors, (844), 207 states have call successors, (207), 16 states have call predecessors, (207), 16 states have return successors, (207), 201 states have call predecessors, (207), 207 states have call successors, (207) [2024-11-08 21:47:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1258 transitions. [2024-11-08 21:47:08,309 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1258 transitions. Word has length 138 [2024-11-08 21:47:08,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:08,309 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1258 transitions. [2024-11-08 21:47:08,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1258 transitions. [2024-11-08 21:47:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 21:47:08,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:08,311 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:08,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 21:47:08,312 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:08,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash -226853011, now seen corresponding path program 1 times [2024-11-08 21:47:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:08,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263475713] [2024-11-08 21:47:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:08,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:47:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:47:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:47:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:47:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:47:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:47:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:47:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:47:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:47:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:47:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:47:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:08,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:08,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263475713] [2024-11-08 21:47:08,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263475713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:08,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:08,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:47:08,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964537755] [2024-11-08 21:47:08,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:08,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:47:08,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:08,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:47:08,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:47:08,416 INFO L87 Difference]: Start difference. First operand 834 states and 1258 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:08,541 INFO L93 Difference]: Finished difference Result 1496 states and 2256 transitions. [2024-11-08 21:47:08,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:47:08,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-08 21:47:08,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:08,547 INFO L225 Difference]: With dead ends: 1496 [2024-11-08 21:47:08,548 INFO L226 Difference]: Without dead ends: 786 [2024-11-08 21:47:08,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-08 21:47:08,551 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 114 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:08,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 245 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:47:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-08 21:47:08,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 784. [2024-11-08 21:47:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 570 states have (on average 1.368421052631579) internal successors, (780), 576 states have internal predecessors, (780), 199 states have call successors, (199), 14 states have call predecessors, (199), 14 states have return successors, (199), 193 states have call predecessors, (199), 199 states have call successors, (199) [2024-11-08 21:47:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1178 transitions. [2024-11-08 21:47:08,621 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1178 transitions. Word has length 138 [2024-11-08 21:47:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:08,621 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1178 transitions. [2024-11-08 21:47:08,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1178 transitions. [2024-11-08 21:47:08,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 21:47:08,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:08,623 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:08,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 21:47:08,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:08,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:08,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1010175940, now seen corresponding path program 1 times [2024-11-08 21:47:08,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:08,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381071174] [2024-11-08 21:47:08,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:08,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:47:08,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269618227] [2024-11-08 21:47:08,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:08,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:47:08,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:08,683 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-08 21:47:08,685 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-08 21:47:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:08,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 21:47:08,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:47:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:09,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:47:09,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:09,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381071174] [2024-11-08 21:47:09,703 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 21:47:09,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269618227] [2024-11-08 21:47:09,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269618227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:09,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:09,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:47:09,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172111657] [2024-11-08 21:47:09,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:09,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:47:09,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:09,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:47:09,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:47:09,707 INFO L87 Difference]: Start difference. First operand 784 states and 1178 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:10,756 INFO L93 Difference]: Finished difference Result 2770 states and 4159 transitions. [2024-11-08 21:47:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 21:47:10,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-08 21:47:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:10,772 INFO L225 Difference]: With dead ends: 2770 [2024-11-08 21:47:10,772 INFO L226 Difference]: Without dead ends: 2110 [2024-11-08 21:47:10,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-08 21:47:10,777 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 428 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:10,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 725 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 21:47:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2024-11-08 21:47:10,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 1568. [2024-11-08 21:47:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1141 states have (on average 1.3567046450482034) internal successors, (1548), 1153 states have internal predecessors, (1548), 398 states have call successors, (398), 28 states have call predecessors, (398), 28 states have return successors, (398), 386 states have call predecessors, (398), 398 states have call successors, (398) [2024-11-08 21:47:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2344 transitions. [2024-11-08 21:47:10,960 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2344 transitions. Word has length 139 [2024-11-08 21:47:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:10,962 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2344 transitions. [2024-11-08 21:47:10,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:10,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2344 transitions. [2024-11-08 21:47:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 21:47:10,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:10,967 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:10,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 21:47:11,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:47:11,172 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:11,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash -309111362, now seen corresponding path program 1 times [2024-11-08 21:47:11,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:11,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784000249] [2024-11-08 21:47:11,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:11,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:47:11,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960884266] [2024-11-08 21:47:11,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:11,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:47:11,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:11,233 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-08 21:47:11,234 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-08 21:47:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:11,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 21:47:11,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:47:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:11,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:47:11,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:11,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784000249] [2024-11-08 21:47:11,686 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 21:47:11,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960884266] [2024-11-08 21:47:11,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960884266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:11,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:11,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:47:11,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927415697] [2024-11-08 21:47:11,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:11,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:47:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:47:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:47:11,689 INFO L87 Difference]: Start difference. First operand 1568 states and 2344 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:12,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:12,632 INFO L93 Difference]: Finished difference Result 6033 states and 9069 transitions. [2024-11-08 21:47:12,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 21:47:12,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-08 21:47:12,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:12,659 INFO L225 Difference]: With dead ends: 6033 [2024-11-08 21:47:12,659 INFO L226 Difference]: Without dead ends: 4468 [2024-11-08 21:47:12,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-08 21:47:12,667 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 361 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:12,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1154 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 21:47:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2024-11-08 21:47:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 3528. [2024-11-08 21:47:13,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3528 states, 2526 states have (on average 1.3365003958828188) internal successors, (3376), 2554 states have internal predecessors, (3376), 935 states have call successors, (935), 66 states have call predecessors, (935), 66 states have return successors, (935), 907 states have call predecessors, (935), 935 states have call successors, (935) [2024-11-08 21:47:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 5246 transitions. [2024-11-08 21:47:13,034 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 5246 transitions. Word has length 139 [2024-11-08 21:47:13,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:13,035 INFO L471 AbstractCegarLoop]: Abstraction has 3528 states and 5246 transitions. [2024-11-08 21:47:13,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:13,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 5246 transitions. [2024-11-08 21:47:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 21:47:13,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:13,039 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:13,057 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-08 21:47:13,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 21:47:13,244 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:13,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:13,245 INFO L85 PathProgramCache]: Analyzing trace with hash -794234149, now seen corresponding path program 1 times [2024-11-08 21:47:13,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:13,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044250339] [2024-11-08 21:47:13,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:47:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:47:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:47:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:47:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:47:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:47:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:47:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:47:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:47:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:47:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:47:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:13,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:13,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044250339] [2024-11-08 21:47:13,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044250339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:13,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:13,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:47:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187668168] [2024-11-08 21:47:13,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:13,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:47:13,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:13,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:47:13,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:47:13,489 INFO L87 Difference]: Start difference. First operand 3528 states and 5246 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:13,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:13,991 INFO L93 Difference]: Finished difference Result 6894 states and 10284 transitions. [2024-11-08 21:47:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:47:13,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-08 21:47:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:14,022 INFO L225 Difference]: With dead ends: 6894 [2024-11-08 21:47:14,022 INFO L226 Difference]: Without dead ends: 4156 [2024-11-08 21:47:14,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:47:14,034 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 114 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:14,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 254 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:47:14,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4156 states. [2024-11-08 21:47:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4156 to 4113. [2024-11-08 21:47:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4113 states, 2951 states have (on average 1.3381904439173162) internal successors, (3949), 2984 states have internal predecessors, (3949), 1085 states have call successors, (1085), 76 states have call predecessors, (1085), 76 states have return successors, (1085), 1052 states have call predecessors, (1085), 1085 states have call successors, (1085) [2024-11-08 21:47:14,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 4113 states and 6119 transitions. [2024-11-08 21:47:14,409 INFO L78 Accepts]: Start accepts. Automaton has 4113 states and 6119 transitions. Word has length 139 [2024-11-08 21:47:14,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:14,410 INFO L471 AbstractCegarLoop]: Abstraction has 4113 states and 6119 transitions. [2024-11-08 21:47:14,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:14,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4113 states and 6119 transitions. [2024-11-08 21:47:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 21:47:14,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:14,412 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:14,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 21:47:14,412 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:14,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:14,413 INFO L85 PathProgramCache]: Analyzing trace with hash -371532323, now seen corresponding path program 1 times [2024-11-08 21:47:14,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:14,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799951192] [2024-11-08 21:47:14,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:14,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:14,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:14,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:14,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:14,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:47:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:14,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:47:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:14,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:47:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:14,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:47:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:14,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:47:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:14,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:47:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:14,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:47:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:14,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:47:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:47:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:47:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:47:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:15,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799951192] [2024-11-08 21:47:15,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799951192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:15,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:15,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:47:15,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872995125] [2024-11-08 21:47:15,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:15,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:47:15,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:15,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:47:15,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:47:15,056 INFO L87 Difference]: Start difference. First operand 4113 states and 6119 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:15,732 INFO L93 Difference]: Finished difference Result 5550 states and 8261 transitions. [2024-11-08 21:47:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:47:15,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-08 21:47:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:15,760 INFO L225 Difference]: With dead ends: 5550 [2024-11-08 21:47:15,761 INFO L226 Difference]: Without dead ends: 3633 [2024-11-08 21:47:15,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 21:47:15,767 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 330 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:15,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 486 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 21:47:15,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2024-11-08 21:47:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3625. [2024-11-08 21:47:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 2591 states have (on average 1.3342338865302972) internal successors, (3457), 2620 states have internal predecessors, (3457), 965 states have call successors, (965), 68 states have call predecessors, (965), 68 states have return successors, (965), 936 states have call predecessors, (965), 965 states have call successors, (965) [2024-11-08 21:47:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 5387 transitions. [2024-11-08 21:47:16,129 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 5387 transitions. Word has length 139 [2024-11-08 21:47:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:16,129 INFO L471 AbstractCegarLoop]: Abstraction has 3625 states and 5387 transitions. [2024-11-08 21:47:16,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 5387 transitions. [2024-11-08 21:47:16,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 21:47:16,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:16,135 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:16,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 21:47:16,136 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:16,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:16,136 INFO L85 PathProgramCache]: Analyzing trace with hash -822195952, now seen corresponding path program 1 times [2024-11-08 21:47:16,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:16,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201900905] [2024-11-08 21:47:16,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:16,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:47:16,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180893467] [2024-11-08 21:47:16,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:16,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:47:16,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:16,214 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-08 21:47:16,215 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-08 21:47:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:16,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 21:47:16,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:47:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:16,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:47:16,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:16,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201900905] [2024-11-08 21:47:16,963 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 21:47:16,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180893467] [2024-11-08 21:47:16,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180893467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:16,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:16,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 21:47:16,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571430143] [2024-11-08 21:47:16,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:16,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 21:47:16,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:16,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 21:47:16,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 21:47:16,966 INFO L87 Difference]: Start difference. First operand 3625 states and 5387 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:18,017 INFO L93 Difference]: Finished difference Result 4555 states and 6767 transitions. [2024-11-08 21:47:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 21:47:18,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-08 21:47:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:18,044 INFO L225 Difference]: With dead ends: 4555 [2024-11-08 21:47:18,046 INFO L226 Difference]: Without dead ends: 3896 [2024-11-08 21:47:18,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-08 21:47:18,051 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 467 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:18,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1002 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 21:47:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2024-11-08 21:47:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3637. [2024-11-08 21:47:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3637 states, 2603 states have (on average 1.3357664233576643) internal successors, (3477), 2632 states have internal predecessors, (3477), 965 states have call successors, (965), 68 states have call predecessors, (965), 68 states have return successors, (965), 936 states have call predecessors, (965), 965 states have call successors, (965) [2024-11-08 21:47:18,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3637 states to 3637 states and 5407 transitions. [2024-11-08 21:47:18,338 INFO L78 Accepts]: Start accepts. Automaton has 3637 states and 5407 transitions. Word has length 140 [2024-11-08 21:47:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:18,338 INFO L471 AbstractCegarLoop]: Abstraction has 3637 states and 5407 transitions. [2024-11-08 21:47:18,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 5407 transitions. [2024-11-08 21:47:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 21:47:18,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:18,342 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:18,359 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-08 21:47:18,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:47:18,546 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:18,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:18,547 INFO L85 PathProgramCache]: Analyzing trace with hash -747749173, now seen corresponding path program 1 times [2024-11-08 21:47:18,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:18,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672762976] [2024-11-08 21:47:18,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:18,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:47:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:47:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:47:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:47:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:47:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:47:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:47:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:47:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:47:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:47:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:47:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:47:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:47:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:47:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:47:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:47:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:18,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:18,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672762976] [2024-11-08 21:47:18,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672762976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:18,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:18,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:47:18,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811876886] [2024-11-08 21:47:18,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:18,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:47:18,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:18,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:47:18,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:47:18,649 INFO L87 Difference]: Start difference. First operand 3637 states and 5407 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:18,929 INFO L93 Difference]: Finished difference Result 8813 states and 13013 transitions. [2024-11-08 21:47:18,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:47:18,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-08 21:47:18,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:18,973 INFO L225 Difference]: With dead ends: 8813 [2024-11-08 21:47:18,974 INFO L226 Difference]: Without dead ends: 5179 [2024-11-08 21:47:18,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-08 21:47:18,987 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 41 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:18,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 229 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:47:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2024-11-08 21:47:19,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 4484. [2024-11-08 21:47:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4484 states, 3450 states have (on average 1.3620289855072463) internal successors, (4699), 3479 states have internal predecessors, (4699), 965 states have call successors, (965), 68 states have call predecessors, (965), 68 states have return successors, (965), 936 states have call predecessors, (965), 965 states have call successors, (965) [2024-11-08 21:47:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6629 transitions. [2024-11-08 21:47:19,343 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6629 transitions. Word has length 140 [2024-11-08 21:47:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:19,343 INFO L471 AbstractCegarLoop]: Abstraction has 4484 states and 6629 transitions. [2024-11-08 21:47:19,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6629 transitions. [2024-11-08 21:47:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 21:47:19,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:19,346 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:19,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 21:47:19,346 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:19,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash -67690803, now seen corresponding path program 1 times [2024-11-08 21:47:19,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:19,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705277483] [2024-11-08 21:47:19,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:19,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:47:19,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1335074519] [2024-11-08 21:47:19,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:19,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:47:19,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:19,412 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-08 21:47:19,414 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-08 21:47:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:47:19,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:47:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:47:19,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:47:19,709 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:47:19,710 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:47:19,729 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-08 21:47:19,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 21:47:19,915 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:20,033 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:47:20,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:47:20 BoogieIcfgContainer [2024-11-08 21:47:20,036 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:47:20,037 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:47:20,037 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:47:20,037 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:47:20,037 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:01" (3/4) ... [2024-11-08 21:47:20,040 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:47:20,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:47:20,042 INFO L158 Benchmark]: Toolchain (without parser) took 19383.91ms. Allocated memory was 172.0MB in the beginning and 631.2MB in the end (delta: 459.3MB). Free memory was 115.6MB in the beginning and 507.3MB in the end (delta: -391.8MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2024-11-08 21:47:20,042 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 172.0MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:47:20,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.38ms. Allocated memory is still 172.0MB. Free memory was 115.6MB in the beginning and 97.9MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 21:47:20,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.21ms. Allocated memory is still 172.0MB. Free memory was 97.9MB in the beginning and 93.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:47:20,043 INFO L158 Benchmark]: Boogie Preprocessor took 68.18ms. Allocated memory is still 172.0MB. Free memory was 93.7MB in the beginning and 88.7MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:47:20,043 INFO L158 Benchmark]: RCFGBuilder took 724.24ms. Allocated memory is still 172.0MB. Free memory was 88.7MB in the beginning and 61.1MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 21:47:20,043 INFO L158 Benchmark]: TraceAbstraction took 18090.46ms. Allocated memory was 172.0MB in the beginning and 631.2MB in the end (delta: 459.3MB). Free memory was 60.1MB in the beginning and 508.4MB in the end (delta: -448.2MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-08 21:47:20,043 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 631.2MB. Free memory was 508.4MB in the beginning and 507.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:47:20,045 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.28ms. Allocated memory is still 172.0MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.38ms. Allocated memory is still 172.0MB. Free memory was 115.6MB in the beginning and 97.9MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.21ms. Allocated memory is still 172.0MB. Free memory was 97.9MB in the beginning and 93.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.18ms. Allocated memory is still 172.0MB. Free memory was 93.7MB in the beginning and 88.7MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 724.24ms. Allocated memory is still 172.0MB. Free memory was 88.7MB in the beginning and 61.1MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18090.46ms. Allocated memory was 172.0MB in the beginning and 631.2MB in the end (delta: 459.3MB). Free memory was 60.1MB in the beginning and 508.4MB in the end (delta: -448.2MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 631.2MB. Free memory was 508.4MB in the beginning and 507.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryFLOATComparisonOperation at line 180. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 256.5; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 7.5; [L25] double var_1_4 = 256.2; [L26] double var_1_5 = 2.75; [L27] signed long int var_1_6 = -64; [L28] double var_1_7 = 8.05; [L29] float var_1_8 = 5.25; [L30] signed long int var_1_11 = 4; [L31] unsigned short int var_1_14 = 10000; [L32] unsigned short int var_1_16 = 5; [L33] unsigned short int var_1_17 = 4; [L34] unsigned char var_1_18 = 100; [L35] unsigned char var_1_19 = 1; [L36] unsigned char var_1_20 = 8; [L37] double var_1_21 = 63.25; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_25 = 0; [L40] unsigned char var_1_26 = 0; [L41] signed long int var_1_27 = 0; [L42] signed short int var_1_29 = 2; [L43] unsigned char var_1_31 = 1; [L44] signed long int var_1_32 = 32; [L45] signed long int var_1_34 = 0; [L46] unsigned char var_1_37 = 1; [L47] unsigned long int var_1_38 = 16; [L48] unsigned char var_1_39 = 0; [L49] unsigned char var_1_40 = 0; [L50] double last_1_var_1_1 = 256.5; [L51] float last_1_var_1_8 = 5.25; [L52] signed long int last_1_var_1_11 = 4; [L53] unsigned short int last_1_var_1_14 = 10000; [L54] unsigned short int last_1_var_1_17 = 4; [L55] unsigned char last_1_var_1_18 = 100; VAL [isInitial=0, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_8 = var_1_8 [L174] last_1_var_1_11 = var_1_11 [L175] last_1_var_1_14 = var_1_14 [L176] last_1_var_1_17 = var_1_17 [L177] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L143] var_1_3 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L144] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L145] var_1_4 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L146] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L147] var_1_5 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L148] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L150] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L151] CALL assume_abort_if_not(var_1_7 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L151] RET assume_abort_if_not(var_1_7 != 0.0F) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L152] var_1_16 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L153] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L154] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L154] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L155] var_1_19 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L156] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L157] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L157] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L158] var_1_20 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L159] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L161] var_1_25 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L162] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L163] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L163] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L164] var_1_26 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L165] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L166] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L166] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L167] var_1_40 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_40 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L168] RET assume_abort_if_not(var_1_40 >= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L169] CALL assume_abort_if_not(var_1_40 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L169] RET assume_abort_if_not(var_1_40 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L188] RET updateVariables() [L189] CALL step() [L59] COND FALSE !(\read(var_1_2)) [L68] var_1_17 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L70] COND TRUE var_1_17 == var_1_18 [L71] var_1_31 = (! var_1_26) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L73] COND TRUE var_1_16 < var_1_11 [L74] var_1_34 = var_1_16 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] EXPR var_1_18 & var_1_17 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] EXPR (var_1_18 & var_1_17) & var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] COND TRUE ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) <= ((var_1_18 & var_1_17) & var_1_18) [L85] var_1_38 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L87] COND TRUE ! var_1_2 [L88] var_1_1 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L92] COND FALSE !(var_1_5 > (var_1_3 / var_1_7)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L97] var_1_27 = var_1_17 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L98] COND TRUE var_1_20 < var_1_17 [L99] var_1_39 = (! (var_1_26 && var_1_40)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L101] unsigned short int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L102] EXPR var_1_6 | var_1_6 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L102] COND FALSE !((var_1_6 + (var_1_6 | var_1_6)) > stepLocal_1) [L105] var_1_29 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L106] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L113] COND TRUE var_1_4 <= last_1_var_1_1 [L114] var_1_11 = (last_1_var_1_14 + -128) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L118] var_1_21 = var_1_5 [L119] var_1_37 = (var_1_2 && var_1_25) [L120] signed long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_0=9872, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L121] COND TRUE (var_1_14 * var_1_17) >= stepLocal_0 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L122] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L126] COND FALSE !(var_1_4 < (- var_1_5)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L133] COND FALSE !(var_1_20 < ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L189] RET step() [L190] CALL, EXPR property() [L180] EXPR (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L180-L181] return (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) ; [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 15, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3523 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3523 mSDsluCounter, 6545 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4150 mSDsCounter, 646 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3864 IncrementalHoareTripleChecker+Invalid, 4510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 646 mSolverCounterUnsat, 2395 mSDtfsCounter, 3864 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 936 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4484occurred in iteration=14, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 2826 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2632 NumberOfCodeBlocks, 2632 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1920 ConstructedInterpolants, 0 QuantifiedInterpolants, 6746 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1083 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 9576/9576 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-08 21:47:20,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.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 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:47:22,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:47:22,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:47:22,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:47:22,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:47:22,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:47:22,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:47:22,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:47:22,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:47:22,563 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:47:22,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:47:22,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:47:22,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:47:22,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:47:22,569 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:47:22,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:47:22,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:47:22,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:47:22,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:47:22,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:47:22,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:47:22,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:47:22,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:47:22,572 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:47:22,572 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:47:22,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:47:22,573 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:47:22,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:47:22,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:47:22,573 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:47:22,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:47:22,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:47:22,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:47:22,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:47:22,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:47:22,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:47:22,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:47:22,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:47:22,585 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:47:22,585 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:47:22,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:47:22,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:47:22,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:47:22,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:47:22,586 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 -> 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 [2024-11-08 21:47:22,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:47:22,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:47:22,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:47:22,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:47:22,933 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:47:22,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-08 21:47:24,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:47:24,791 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:47:24,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-08 21:47:24,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26df6da00/785a9b2d07594b01881a69296f83b0b0/FLAG192be5c5b [2024-11-08 21:47:24,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26df6da00/785a9b2d07594b01881a69296f83b0b0 [2024-11-08 21:47:24,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:47:24,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:47:24,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:47:24,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:47:24,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:47:24,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:47:24" (1/1) ... [2024-11-08 21:47:24,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b58587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:24, skipping insertion in model container [2024-11-08 21:47:24,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:47:24" (1/1) ... [2024-11-08 21:47:24,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:47:25,066 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2024-11-08 21:47:25,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:47:25,185 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:47:25,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2024-11-08 21:47:25,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:47:25,282 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:47:25,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:25 WrapperNode [2024-11-08 21:47:25,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:47:25,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:47:25,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:47:25,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:47:25,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:25" (1/1) ... [2024-11-08 21:47:25,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:25" (1/1) ... [2024-11-08 21:47:25,348 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-11-08 21:47:25,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:47:25,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:47:25,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:47:25,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:47:25,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:25" (1/1) ... [2024-11-08 21:47:25,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:25" (1/1) ... [2024-11-08 21:47:25,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:25" (1/1) ... [2024-11-08 21:47:25,396 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-08 21:47:25,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:25" (1/1) ... [2024-11-08 21:47:25,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:25" (1/1) ... [2024-11-08 21:47:25,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:25" (1/1) ... [2024-11-08 21:47:25,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:25" (1/1) ... [2024-11-08 21:47:25,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:25" (1/1) ... [2024-11-08 21:47:25,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:25" (1/1) ... [2024-11-08 21:47:25,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:47:25,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:47:25,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:47:25,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:47:25,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:25" (1/1) ... [2024-11-08 21:47:25,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:47:25,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:25,486 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-08 21:47:25,489 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-08 21:47:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:47:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:47:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:47:25,530 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:47:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:47:25,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:47:25,624 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:47:25,626 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:47:38,833 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 21:47:38,833 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:47:38,851 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:47:38,852 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:47:38,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:38 BoogieIcfgContainer [2024-11-08 21:47:38,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:47:38,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:47:38,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:47:38,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:47:38,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:47:24" (1/3) ... [2024-11-08 21:47:38,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450da513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:47:38, skipping insertion in model container [2024-11-08 21:47:38,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:25" (2/3) ... [2024-11-08 21:47:38,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450da513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:47:38, skipping insertion in model container [2024-11-08 21:47:38,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:38" (3/3) ... [2024-11-08 21:47:38,864 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-08 21:47:38,882 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:47:38,883 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:47:38,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:47:38,959 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;@276a1be7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:47:38,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:47:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 21:47:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 21:47:38,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:38,975 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:38,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:38,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1793733614, now seen corresponding path program 1 times [2024-11-08 21:47:38,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:47:38,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316729389] [2024-11-08 21:47:38,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:38,992 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-08 21:47:38,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:47:38,994 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-08 21:47:39,010 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-08 21:47:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:39,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:47:39,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:47:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:47:42,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:47:42,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:47:42,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316729389] [2024-11-08 21:47:42,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316729389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:42,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:42,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:47:42,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476818512] [2024-11-08 21:47:42,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:42,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:47:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:47:42,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:47:42,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:47:42,850 INFO L87 Difference]: Start difference. First operand has 75 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:47,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:47:51,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:47:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:51,233 INFO L93 Difference]: Finished difference Result 209 states and 376 transitions. [2024-11-08 21:47:51,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:47:51,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 132 [2024-11-08 21:47:51,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:51,326 INFO L225 Difference]: With dead ends: 209 [2024-11-08 21:47:51,326 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 21:47:51,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:47:51,332 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 40 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:51,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2024-11-08 21:47:51,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 21:47:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2024-11-08 21:47:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 21:47:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 211 transitions. [2024-11-08 21:47:51,395 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 211 transitions. Word has length 132 [2024-11-08 21:47:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:51,397 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 211 transitions. [2024-11-08 21:47:51,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:47:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 211 transitions. [2024-11-08 21:47:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 21:47:51,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:51,400 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:51,420 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-08 21:47:51,601 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-08 21:47:51,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:51,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:51,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2051899052, now seen corresponding path program 1 times [2024-11-08 21:47:51,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:47:51,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145158071] [2024-11-08 21:47:51,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:51,603 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-08 21:47:51,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:47:51,607 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-08 21:47:51,609 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-08 21:47:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:52,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 21:47:52,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 21:48:01,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:48:01,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:48:01,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145158071] [2024-11-08 21:48:01,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145158071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:01,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:01,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:48:01,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374259586] [2024-11-08 21:48:01,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:01,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:48:01,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:48:01,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:48:01,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:48:01,501 INFO L87 Difference]: Start difference. First operand 135 states and 211 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 21:48:09,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:48:12,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []