/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-90.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 13:13:39,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 13:13:39,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 13:13:39,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 13:13:39,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 13:13:39,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 13:13:39,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 13:13:39,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 13:13:39,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 13:13:39,471 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 13:13:39,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 13:13:39,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 13:13:39,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 13:13:39,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 13:13:39,473 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 13:13:39,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 13:13:39,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 13:13:39,474 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 13:13:39,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 13:13:39,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 13:13:39,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 13:13:39,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 13:13:39,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 13:13:39,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 13:13:39,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 13:13:39,475 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 13:13:39,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 13:13:39,475 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 13:13:39,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 13:13:39,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 13:13:39,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 13:13:39,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 13:13:39,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 13:13:39,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 13:13:39,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 13:13:39,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 13:13:39,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 13:13:39,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 13:13:39,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 13:13:39,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 13:13:39,478 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 13:13:39,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 13:13:39,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 13:13:39,478 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: Use bitabs translation -> true [2023-12-19 13:13:39,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 13:13:39,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 13:13:39,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 13:13:39,653 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 13:13:39,653 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 13:13:39,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-90.i [2023-12-19 13:13:40,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 13:13:40,928 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 13:13:40,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-90.i [2023-12-19 13:13:40,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbe3f08ab/38c1835d969b42e69bb335a92f7fb491/FLAG35b39f870 [2023-12-19 13:13:40,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbe3f08ab/38c1835d969b42e69bb335a92f7fb491 [2023-12-19 13:13:40,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 13:13:40,961 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 13:13:40,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 13:13:40,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 13:13:40,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 13:13:40,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:13:40" (1/1) ... [2023-12-19 13:13:40,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7224c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:40, skipping insertion in model container [2023-12-19 13:13:40,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:13:40" (1/1) ... [2023-12-19 13:13:41,008 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 13:13:41,098 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-90.i[916,929] [2023-12-19 13:13:41,210 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 13:13:41,228 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 13:13:41,241 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-90.i[916,929] [2023-12-19 13:13:41,307 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 13:13:41,319 INFO L206 MainTranslator]: Completed translation [2023-12-19 13:13:41,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:41 WrapperNode [2023-12-19 13:13:41,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 13:13:41,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 13:13:41,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 13:13:41,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 13:13:41,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:41" (1/1) ... [2023-12-19 13:13:41,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:41" (1/1) ... [2023-12-19 13:13:41,399 INFO L138 Inliner]: procedures = 26, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 396 [2023-12-19 13:13:41,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 13:13:41,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 13:13:41,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 13:13:41,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 13:13:41,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:41" (1/1) ... [2023-12-19 13:13:41,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:41" (1/1) ... [2023-12-19 13:13:41,413 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:41" (1/1) ... [2023-12-19 13:13:41,472 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]. [2023-12-19 13:13:41,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:41" (1/1) ... [2023-12-19 13:13:41,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:41" (1/1) ... [2023-12-19 13:13:41,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:41" (1/1) ... [2023-12-19 13:13:41,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:41" (1/1) ... [2023-12-19 13:13:41,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:41" (1/1) ... [2023-12-19 13:13:41,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:41" (1/1) ... [2023-12-19 13:13:41,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 13:13:41,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 13:13:41,532 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 13:13:41,532 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 13:13:41,533 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:41" (1/1) ... [2023-12-19 13:13:41,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 13:13:41,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:13:41,557 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) [2023-12-19 13:13:41,579 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 [2023-12-19 13:13:41,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 13:13:41,583 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 13:13:41,584 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 13:13:41,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 13:13:41,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 13:13:41,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 13:13:41,689 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 13:13:41,691 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 13:13:42,155 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 13:13:42,197 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 13:13:42,197 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 13:13:42,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:13:42 BoogieIcfgContainer [2023-12-19 13:13:42,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 13:13:42,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 13:13:42,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 13:13:42,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 13:13:42,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:13:40" (1/3) ... [2023-12-19 13:13:42,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2349c5b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:13:42, skipping insertion in model container [2023-12-19 13:13:42,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:41" (2/3) ... [2023-12-19 13:13:42,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2349c5b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:13:42, skipping insertion in model container [2023-12-19 13:13:42,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:13:42" (3/3) ... [2023-12-19 13:13:42,203 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-90.i [2023-12-19 13:13:42,215 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 13:13:42,215 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 13:13:42,257 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 13:13:42,261 INFO L357 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, mHoare=true, 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;@457c30e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 13:13:42,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 13:13:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2023-12-19 13:13:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2023-12-19 13:13:42,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:13:42,284 INFO L195 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:13:42,284 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:13:42,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:13:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash -400446013, now seen corresponding path program 1 times [2023-12-19 13:13:42,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:13:42,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614832881] [2023-12-19 13:13:42,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:42,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:13:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:13:42,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:13:42,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614832881] [2023-12-19 13:13:42,551 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-19 13:13:42,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284145871] [2023-12-19 13:13:42,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:42,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:13:42,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:13:42,572 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) [2023-12-19 13:13:42,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 13:13:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:13:42,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-19 13:13:42,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 13:13:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2023-12-19 13:13:42,979 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 13:13:42,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284145871] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:13:42,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:13:42,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 13:13:42,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807282621] [2023-12-19 13:13:42,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:13:42,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 13:13:42,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:13:43,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 13:13:43,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 13:13:43,018 INFO L87 Difference]: Start difference. First operand has 153 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) [2023-12-19 13:13:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:13:43,079 INFO L93 Difference]: Finished difference Result 303 states and 553 transitions. [2023-12-19 13:13:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 13:13:43,082 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) Word has length 347 [2023-12-19 13:13:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:13:43,092 INFO L225 Difference]: With dead ends: 303 [2023-12-19 13:13:43,092 INFO L226 Difference]: Without dead ends: 151 [2023-12-19 13:13:43,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 13:13:43,103 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 13:13:43,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 13:13:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-19 13:13:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2023-12-19 13:13:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2023-12-19 13:13:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 245 transitions. [2023-12-19 13:13:43,164 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 245 transitions. Word has length 347 [2023-12-19 13:13:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:13:43,166 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 245 transitions. [2023-12-19 13:13:43,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) [2023-12-19 13:13:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2023-12-19 13:13:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2023-12-19 13:13:43,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:13:43,174 INFO L195 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:13:43,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 13:13:43,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-19 13:13:43,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:13:43,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:13:43,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1690543041, now seen corresponding path program 1 times [2023-12-19 13:13:43,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:13:43,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029932410] [2023-12-19 13:13:43,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:43,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:13:43,447 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 13:13:43,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1849561489] [2023-12-19 13:13:43,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:43,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:13:43,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:13:43,456 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) [2023-12-19 13:13:43,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 13:13:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:13:43,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-19 13:13:43,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 13:13:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2023-12-19 13:13:43,749 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 13:13:43,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:13:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029932410] [2023-12-19 13:13:43,750 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 13:13:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849561489] [2023-12-19 13:13:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849561489] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:13:43,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:13:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 13:13:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887654539] [2023-12-19 13:13:43,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:13:43,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 13:13:43,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:13:43,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 13:13:43,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 13:13:43,757 INFO L87 Difference]: Start difference. First operand 151 states and 245 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2023-12-19 13:13:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:13:44,100 INFO L93 Difference]: Finished difference Result 659 states and 1067 transitions. [2023-12-19 13:13:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 13:13:44,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 347 [2023-12-19 13:13:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:13:44,108 INFO L225 Difference]: With dead ends: 659 [2023-12-19 13:13:44,109 INFO L226 Difference]: Without dead ends: 509 [2023-12-19 13:13:44,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 13:13:44,112 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 476 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 13:13:44,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 905 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 13:13:44,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2023-12-19 13:13:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 280. [2023-12-19 13:13:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 184 states have (on average 1.4728260869565217) internal successors, (271), 185 states have internal predecessors, (271), 93 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2023-12-19 13:13:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 457 transitions. [2023-12-19 13:13:44,145 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 457 transitions. Word has length 347 [2023-12-19 13:13:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:13:44,146 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 457 transitions. [2023-12-19 13:13:44,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2023-12-19 13:13:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 457 transitions. [2023-12-19 13:13:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2023-12-19 13:13:44,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:13:44,149 INFO L195 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:13:44,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 13:13:44,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-19 13:13:44,356 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:13:44,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:13:44,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1296176255, now seen corresponding path program 1 times [2023-12-19 13:13:44,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:13:44,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706850297] [2023-12-19 13:13:44,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:44,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:13:44,434 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 13:13:44,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [472901972] [2023-12-19 13:13:44,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:44,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:13:44,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:13:44,436 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) [2023-12-19 13:13:44,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 13:13:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:13:44,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 13:13:44,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 13:13:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 2892 proven. 63 refuted. 0 times theorem prover too weak. 2985 trivial. 0 not checked. [2023-12-19 13:13:44,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 13:13:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 99 proven. 63 refuted. 0 times theorem prover too weak. 5778 trivial. 0 not checked. [2023-12-19 13:13:45,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:13:45,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706850297] [2023-12-19 13:13:45,023 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 13:13:45,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472901972] [2023-12-19 13:13:45,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472901972] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 13:13:45,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 13:13:45,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-19 13:13:45,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568004685] [2023-12-19 13:13:45,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 13:13:45,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 13:13:45,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:13:45,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 13:13:45,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 13:13:45,026 INFO L87 Difference]: Start difference. First operand 280 states and 457 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) [2023-12-19 13:13:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:13:45,329 INFO L93 Difference]: Finished difference Result 569 states and 921 transitions. [2023-12-19 13:13:45,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 13:13:45,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) Word has length 347 [2023-12-19 13:13:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:13:45,332 INFO L225 Difference]: With dead ends: 569 [2023-12-19 13:13:45,332 INFO L226 Difference]: Without dead ends: 290 [2023-12-19 13:13:45,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-19 13:13:45,334 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 365 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 13:13:45,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 421 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 13:13:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-12-19 13:13:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2023-12-19 13:13:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 190 states have (on average 1.4421052631578948) internal successors, (274), 191 states have internal predecessors, (274), 93 states have call successors, (93), 4 states have call predecessors, (93), 4 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2023-12-19 13:13:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 460 transitions. [2023-12-19 13:13:45,354 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 460 transitions. Word has length 347 [2023-12-19 13:13:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:13:45,355 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 460 transitions. [2023-12-19 13:13:45,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) [2023-12-19 13:13:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 460 transitions. [2023-12-19 13:13:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2023-12-19 13:13:45,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:13:45,358 INFO L195 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:13:45,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-19 13:13:45,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:13:45,565 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:13:45,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:13:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash -623349082, now seen corresponding path program 1 times [2023-12-19 13:13:45,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:13:45,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460634162] [2023-12-19 13:13:45,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:45,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:13:45,602 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 13:13:45,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217708923] [2023-12-19 13:13:45,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:45,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:13:45,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:13:45,603 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) [2023-12-19 13:13:45,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 13:13:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:13:45,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-19 13:13:45,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 13:13:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2023-12-19 13:13:45,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 13:13:45,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:13:45,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460634162] [2023-12-19 13:13:45,845 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 13:13:45,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217708923] [2023-12-19 13:13:45,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217708923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:13:45,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:13:45,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 13:13:45,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313976813] [2023-12-19 13:13:45,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:13:45,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 13:13:45,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:13:45,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 13:13:45,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 13:13:45,848 INFO L87 Difference]: Start difference. First operand 288 states and 460 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2023-12-19 13:13:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:13:45,894 INFO L93 Difference]: Finished difference Result 663 states and 1064 transitions. [2023-12-19 13:13:45,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 13:13:45,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 348 [2023-12-19 13:13:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:13:45,899 INFO L225 Difference]: With dead ends: 663 [2023-12-19 13:13:45,899 INFO L226 Difference]: Without dead ends: 376 [2023-12-19 13:13:45,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 13:13:45,902 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 69 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 13:13:45,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 470 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 13:13:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-12-19 13:13:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 364. [2023-12-19 13:13:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 266 states have (on average 1.5112781954887218) internal successors, (402), 267 states have internal predecessors, (402), 93 states have call successors, (93), 4 states have call predecessors, (93), 4 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2023-12-19 13:13:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 588 transitions. [2023-12-19 13:13:45,930 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 588 transitions. Word has length 348 [2023-12-19 13:13:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:13:45,931 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 588 transitions. [2023-12-19 13:13:45,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2023-12-19 13:13:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 588 transitions. [2023-12-19 13:13:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2023-12-19 13:13:45,934 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:13:45,934 INFO L195 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:13:45,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-19 13:13:46,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:13:46,141 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:13:46,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:13:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1132822172, now seen corresponding path program 1 times [2023-12-19 13:13:46,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:13:46,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012482466] [2023-12-19 13:13:46,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:46,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:13:46,172 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 13:13:46,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905752766] [2023-12-19 13:13:46,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:46,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:13:46,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:13:46,189 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 13:13:46,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-19 13:13:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:13:46,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 13:13:46,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 13:13:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 2562 proven. 48 refuted. 0 times theorem prover too weak. 3330 trivial. 0 not checked. [2023-12-19 13:13:46,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 13:13:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 114 proven. 48 refuted. 0 times theorem prover too weak. 5778 trivial. 0 not checked. [2023-12-19 13:13:46,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:13:46,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012482466] [2023-12-19 13:13:46,742 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 13:13:46,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905752766] [2023-12-19 13:13:46,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905752766] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 13:13:46,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 13:13:46,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-19 13:13:46,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114668656] [2023-12-19 13:13:46,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 13:13:46,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 13:13:46,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:13:46,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 13:13:46,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 13:13:46,750 INFO L87 Difference]: Start difference. First operand 364 states and 588 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2023-12-19 13:13:46,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:13:46,949 INFO L93 Difference]: Finished difference Result 578 states and 925 transitions. [2023-12-19 13:13:46,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 13:13:46,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) Word has length 348 [2023-12-19 13:13:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:13:46,952 INFO L225 Difference]: With dead ends: 578 [2023-12-19 13:13:46,952 INFO L226 Difference]: Without dead ends: 215 [2023-12-19 13:13:46,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 688 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-19 13:13:46,954 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 155 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 13:13:46,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 421 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 13:13:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-19 13:13:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 201. [2023-12-19 13:13:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 141 states have (on average 1.4539007092198581) internal successors, (205), 141 states have internal predecessors, (205), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2023-12-19 13:13:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 315 transitions. [2023-12-19 13:13:46,977 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 315 transitions. Word has length 348 [2023-12-19 13:13:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:13:46,977 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 315 transitions. [2023-12-19 13:13:46,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2023-12-19 13:13:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 315 transitions. [2023-12-19 13:13:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2023-12-19 13:13:46,994 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:13:46,994 INFO L195 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:13:47,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-19 13:13:47,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:13:47,195 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:13:47,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:13:47,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1091283287, now seen corresponding path program 1 times [2023-12-19 13:13:47,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:13:47,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949921600] [2023-12-19 13:13:47,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:47,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:13:47,232 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 13:13:47,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [356648108] [2023-12-19 13:13:47,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:47,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:13:47,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:13:47,233 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 13:13:47,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-19 13:13:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:13:47,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-19 13:13:47,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 13:13:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 1343 proven. 21 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2023-12-19 13:13:47,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 13:13:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 309 proven. 12 refuted. 0 times theorem prover too weak. 5619 trivial. 0 not checked. [2023-12-19 13:13:48,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:13:48,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949921600] [2023-12-19 13:13:48,124 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 13:13:48,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356648108] [2023-12-19 13:13:48,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356648108] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 13:13:48,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 13:13:48,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-12-19 13:13:48,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248165335] [2023-12-19 13:13:48,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 13:13:48,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-19 13:13:48,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:13:48,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-19 13:13:48,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-12-19 13:13:48,126 INFO L87 Difference]: Start difference. First operand 201 states and 315 transitions. Second operand has 19 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 19 states have internal predecessors, (118), 4 states have call successors, (61), 3 states have call predecessors, (61), 8 states have return successors, (62), 6 states have call predecessors, (62), 4 states have call successors, (62) [2023-12-19 13:13:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:13:49,056 INFO L93 Difference]: Finished difference Result 565 states and 852 transitions. [2023-12-19 13:13:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-19 13:13:49,057 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 19 states have internal predecessors, (118), 4 states have call successors, (61), 3 states have call predecessors, (61), 8 states have return successors, (62), 6 states have call predecessors, (62), 4 states have call successors, (62) Word has length 349 [2023-12-19 13:13:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:13:49,059 INFO L225 Difference]: With dead ends: 565 [2023-12-19 13:13:49,059 INFO L226 Difference]: Without dead ends: 365 [2023-12-19 13:13:49,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 681 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=519, Invalid=1373, Unknown=0, NotChecked=0, Total=1892 [2023-12-19 13:13:49,060 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 437 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 13:13:49,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1094 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 13:13:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-12-19 13:13:49,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 213. [2023-12-19 13:13:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 150 states have (on average 1.4) internal successors, (210), 150 states have internal predecessors, (210), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2023-12-19 13:13:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 320 transitions. [2023-12-19 13:13:49,076 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 320 transitions. Word has length 349 [2023-12-19 13:13:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:13:49,077 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 320 transitions. [2023-12-19 13:13:49,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 19 states have internal predecessors, (118), 4 states have call successors, (61), 3 states have call predecessors, (61), 8 states have return successors, (62), 6 states have call predecessors, (62), 4 states have call successors, (62) [2023-12-19 13:13:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 320 transitions. [2023-12-19 13:13:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2023-12-19 13:13:49,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:13:49,080 INFO L195 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:13:49,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 13:13:49,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:13:49,287 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:13:49,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:13:49,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1231831897, now seen corresponding path program 1 times [2023-12-19 13:13:49,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:13:49,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002590113] [2023-12-19 13:13:49,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:13:49,320 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 13:13:49,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [932434824] [2023-12-19 13:13:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:49,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:13:49,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:13:49,321 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 13:13:49,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-19 13:13:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:13:49,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-19 13:13:49,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 13:13:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2023-12-19 13:13:50,303 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 13:13:50,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:13:50,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002590113] [2023-12-19 13:13:50,303 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 13:13:50,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932434824] [2023-12-19 13:13:50,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932434824] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:13:50,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:13:50,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 13:13:50,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043291268] [2023-12-19 13:13:50,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:13:50,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 13:13:50,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:13:50,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 13:13:50,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 13:13:50,305 INFO L87 Difference]: Start difference. First operand 213 states and 320 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2023-12-19 13:13:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:13:50,530 INFO L93 Difference]: Finished difference Result 600 states and 896 transitions. [2023-12-19 13:13:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 13:13:50,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 349 [2023-12-19 13:13:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:13:50,533 INFO L225 Difference]: With dead ends: 600 [2023-12-19 13:13:50,533 INFO L226 Difference]: Without dead ends: 388 [2023-12-19 13:13:50,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 13:13:50,534 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 129 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 13:13:50,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 678 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 13:13:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-12-19 13:13:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 343. [2023-12-19 13:13:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 218 states have (on average 1.311926605504587) internal successors, (286), 218 states have internal predecessors, (286), 110 states have call successors, (110), 14 states have call predecessors, (110), 14 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2023-12-19 13:13:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 506 transitions. [2023-12-19 13:13:50,560 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 506 transitions. Word has length 349 [2023-12-19 13:13:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:13:50,560 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 506 transitions. [2023-12-19 13:13:50,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2023-12-19 13:13:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 506 transitions. [2023-12-19 13:13:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2023-12-19 13:13:50,562 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:13:50,562 INFO L195 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:13:50,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-19 13:13:50,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:13:50,769 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:13:50,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:13:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash -83643737, now seen corresponding path program 1 times [2023-12-19 13:13:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:13:50,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904073592] [2023-12-19 13:13:50,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:50,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:13:50,807 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 13:13:50,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [274971787] [2023-12-19 13:13:50,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:50,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:13:50,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:13:50,808 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 13:13:50,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-19 13:13:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:13:51,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-19 13:13:51,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 13:13:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 3284 proven. 444 refuted. 0 times theorem prover too weak. 2212 trivial. 0 not checked. [2023-12-19 13:13:53,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 13:13:54,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 162 proven. 315 refuted. 0 times theorem prover too weak. 5463 trivial. 0 not checked. [2023-12-19 13:13:54,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:13:54,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904073592] [2023-12-19 13:13:54,062 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 13:13:54,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274971787] [2023-12-19 13:13:54,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274971787] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 13:13:54,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 13:13:54,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2023-12-19 13:13:54,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890763632] [2023-12-19 13:13:54,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 13:13:54,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-19 13:13:54,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:13:54,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-19 13:13:54,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2023-12-19 13:13:54,064 INFO L87 Difference]: Start difference. First operand 343 states and 506 transitions. Second operand has 29 states, 28 states have (on average 5.75) internal successors, (161), 26 states have internal predecessors, (161), 8 states have call successors, (105), 5 states have call predecessors, (105), 10 states have return successors, (106), 8 states have call predecessors, (106), 8 states have call successors, (106) [2023-12-19 13:13:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:13:57,871 INFO L93 Difference]: Finished difference Result 1075 states and 1519 transitions. [2023-12-19 13:13:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-12-19 13:13:57,872 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 5.75) internal successors, (161), 26 states have internal predecessors, (161), 8 states have call successors, (105), 5 states have call predecessors, (105), 10 states have return successors, (106), 8 states have call predecessors, (106), 8 states have call successors, (106) Word has length 350 [2023-12-19 13:13:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:13:57,875 INFO L225 Difference]: With dead ends: 1075 [2023-12-19 13:13:57,875 INFO L226 Difference]: Without dead ends: 863 [2023-12-19 13:13:57,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 682 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2708 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2392, Invalid=7310, Unknown=0, NotChecked=0, Total=9702 [2023-12-19 13:13:57,879 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 1211 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-19 13:13:57,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 1615 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-19 13:13:57,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2023-12-19 13:13:57,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 637. [2023-12-19 13:13:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 432 states have (on average 1.3009259259259258) internal successors, (562), 432 states have internal predecessors, (562), 165 states have call successors, (165), 39 states have call predecessors, (165), 39 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2023-12-19 13:13:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 892 transitions. [2023-12-19 13:13:57,987 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 892 transitions. Word has length 350 [2023-12-19 13:13:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:13:57,987 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 892 transitions. [2023-12-19 13:13:57,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 5.75) internal successors, (161), 26 states have internal predecessors, (161), 8 states have call successors, (105), 5 states have call predecessors, (105), 10 states have return successors, (106), 8 states have call predecessors, (106), 8 states have call successors, (106) [2023-12-19 13:13:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 892 transitions. [2023-12-19 13:13:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2023-12-19 13:13:57,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:13:57,990 INFO L195 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:13:58,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-19 13:13:58,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-19 13:13:58,199 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:13:58,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:13:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1094760987, now seen corresponding path program 1 times [2023-12-19 13:13:58,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:13:58,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673567909] [2023-12-19 13:13:58,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:58,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:13:58,242 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 13:13:58,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1511726064] [2023-12-19 13:13:58,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:13:58,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:13:58,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:13:58,258 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 13:13:58,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-19 13:14:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:14:08,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 100 conjunts are in the unsatisfiable core [2023-12-19 13:14:08,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 13:14:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 4101 proven. 675 refuted. 0 times theorem prover too weak. 1164 trivial. 0 not checked. [2023-12-19 13:14:19,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 13:15:02,112 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-19 13:15:34,151 WARN L293 SmtUtils]: Spent 5.32s on a formula simplification. DAG size of input: 75 DAG size of output: 39 (called from [L 183] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2023-12-19 13:15:48,922 WARN L293 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 64 DAG size of output: 36 (called from [L 183] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2023-12-19 13:16:01,996 WARN L293 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 44 DAG size of output: 33 (called from [L 183] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2023-12-19 13:16:37,388 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse92 (mod c_~var_1_30~0 4294967296))) (let ((.cse8 (mod c_~var_1_48~0 256)) (.cse11 (mod c_~var_1_62~0 4294967296)) (.cse55 (mod c_~var_1_38~0 4294967296)) (.cse160 (+ .cse92 1)) (.cse79 (mod c_~var_1_29~0 4294967296)) (.cse18 (* c_~var_1_29~0 2))) (let ((.cse1 (< c_~var_1_29~0 0)) (.cse16 (+ c_~var_1_31~0 .cse18)) (.cse0 (+ c_~var_1_30~0 1)) (.cse22 (+ c_~var_1_31~0 c_~var_1_38~0 c_~var_1_29~0)) (.cse2 (+ c_~var_1_31~0 c_~var_1_29~0 1)) (.cse5 (+ c_~var_1_31~0 c_~var_1_29~0)) (.cse13 (< .cse92 .cse79)) (.cse4 (< .cse55 .cse160)) (.cse12 (< .cse92 .cse55)) (.cse25 (+ c_~var_1_31~0 c_~var_1_30~0)) (.cse28 (* c_~var_1_29~0 4294967295)) (.cse20 (< .cse79 (+ .cse55 1))) (.cse15 (< .cse55 .cse79)) (.cse9 (< .cse8 (+ (* 4294967296 (div .cse8 4294967296)) .cse11 1))) (.cse14 (< .cse79 .cse160)) (.cse29 (+ c_~var_1_31~0 1)) (.cse26 (* (- 1) c_~var_1_29~0)) (.cse37 (< 0 (+ c_~var_1_29~0 1)))) (and (or (< c_~var_1_32~0 .cse0) (let ((.cse36 (+ c_~var_1_32~0 c_~var_1_29~0)) (.cse7 (+ 1 .cse8))) (let ((.cse24 (let ((.cse39 (+ c_~var_1_32~0 1))) (let ((.cse41 (and (or (forall ((v_y_82 Int)) (let ((.cse44 (* v_y_82 256))) (or (< (mod (+ (* v_y_82 4294967040) c_~var_1_38~0 c_~var_1_32~0) 4294967296) .cse7) (< (+ .cse44 4) c_~var_1_32~0) (< (+ .cse44 .cse8) .cse39) (< c_~var_1_32~0 .cse44)))) .cse9) (forall ((v_y_82 Int)) (let ((.cse45 (* v_y_82 256))) (or (< (+ c_~var_1_38~0 c_~var_1_32~0) (+ (* (div (+ (* v_y_82 (- 256)) c_~var_1_38~0 c_~var_1_32~0) 4294967296) 4294967296) .cse11 .cse45 1)) (< .cse8 (mod (+ (* v_y_82 4294967040) c_~var_1_38~0 c_~var_1_32~0) 4294967296)) (< (+ .cse45 4) c_~var_1_32~0) (< (+ .cse45 .cse8) .cse39) (< c_~var_1_32~0 .cse45))))))) (and (or (and (or .cse12 (and (forall ((v_y_82 Int)) (let ((.cse38 (* v_y_82 256))) (or (< .cse8 (mod (+ c_~var_1_30~0 (* v_y_82 4294967040) c_~var_1_32~0) 4294967296)) (< (+ .cse38 4) c_~var_1_32~0) (< (+ c_~var_1_30~0 c_~var_1_32~0) (+ (* (div (+ c_~var_1_30~0 (* v_y_82 (- 256)) c_~var_1_32~0) 4294967296) 4294967296) .cse11 .cse38 1)) (< (+ .cse38 .cse8) .cse39) (< c_~var_1_32~0 .cse38)))) (or (forall ((v_y_82 Int)) (let ((.cse40 (* v_y_82 256))) (or (< (mod (+ c_~var_1_30~0 (* v_y_82 4294967040) c_~var_1_32~0) 4294967296) .cse7) (< (+ .cse40 4) c_~var_1_32~0) (< (+ .cse40 .cse8) .cse39) (< c_~var_1_32~0 .cse40)))) .cse9))) (or .cse4 .cse41)) .cse13) (or .cse14 (and (or .cse15 .cse41) (or (and (forall ((v_y_82 Int)) (let ((.cse42 (* v_y_82 256))) (or (< (+ .cse42 4) c_~var_1_32~0) (< .cse36 (+ (* (div (+ (* v_y_82 (- 256)) c_~var_1_32~0 c_~var_1_29~0) 4294967296) 4294967296) .cse11 .cse42 1)) (< (+ .cse42 .cse8) .cse39) (< c_~var_1_32~0 .cse42) (< .cse8 (mod (+ (* v_y_82 4294967040) c_~var_1_32~0 c_~var_1_29~0) 4294967296))))) (or (forall ((v_y_82 Int)) (let ((.cse43 (* v_y_82 256))) (or (< (mod (+ (* v_y_82 4294967040) c_~var_1_32~0 c_~var_1_29~0) 4294967296) .cse7) (< (+ .cse43 4) c_~var_1_32~0) (< (+ .cse43 .cse8) .cse39) (< c_~var_1_32~0 .cse43)))) .cse9)) .cse20)))))))) (and (or .cse1 (and (or (< c_~var_1_32~0 .cse2) (let ((.cse3 (and (or (forall ((v_y_82 Int)) (let ((.cse21 (* v_y_82 256))) (or (< .cse5 .cse21) (< (+ .cse21 .cse8) .cse2) (< (+ .cse21 4) .cse5) (< (mod (+ c_~var_1_31~0 (* v_y_82 4294967040) c_~var_1_38~0 c_~var_1_29~0) 4294967296) .cse7)))) .cse9) (forall ((v_y_82 Int)) (let ((.cse23 (* v_y_82 256))) (or (< .cse22 (+ (* (div (+ c_~var_1_31~0 (* v_y_82 (- 256)) c_~var_1_38~0 c_~var_1_29~0) 4294967296) 4294967296) .cse11 .cse23 1)) (< .cse5 .cse23) (< (+ .cse23 .cse8) .cse2) (< (+ .cse23 4) .cse5) (< .cse8 (mod (+ c_~var_1_31~0 (* v_y_82 4294967040) c_~var_1_38~0 c_~var_1_29~0) 4294967296)))))))) (and (or (and (or .cse3 .cse4) (or (and (or (forall ((v_y_82 Int)) (let ((.cse6 (* v_y_82 256))) (or (< .cse5 .cse6) (< (mod (+ c_~var_1_31~0 c_~var_1_30~0 (* v_y_82 4294967040) c_~var_1_29~0) 4294967296) .cse7) (< (+ .cse6 .cse8) .cse2) (< (+ .cse6 4) .cse5)))) .cse9) (forall ((v_y_82 Int)) (let ((.cse10 (* v_y_82 256))) (or (< .cse5 .cse10) (< .cse8 (mod (+ c_~var_1_31~0 c_~var_1_30~0 (* v_y_82 4294967040) c_~var_1_29~0) 4294967296)) (< (+ .cse10 .cse8) .cse2) (< (+ c_~var_1_31~0 c_~var_1_30~0 c_~var_1_29~0) (+ .cse11 .cse10 (* (div (+ c_~var_1_31~0 c_~var_1_30~0 (* v_y_82 (- 256)) c_~var_1_29~0) 4294967296) 4294967296) 1)) (< (+ .cse10 4) .cse5))))) .cse12)) .cse13) (or .cse14 (and (or .cse15 .cse3) (or (and (forall ((v_y_82 Int)) (let ((.cse17 (* v_y_82 256))) (or (< .cse16 (+ .cse11 .cse17 1 (* (div (+ c_~var_1_31~0 (* v_y_82 (- 256)) .cse18) 4294967296) 4294967296))) (< .cse5 .cse17) (< (+ .cse17 .cse8) .cse2) (< (+ .cse17 4) .cse5) (< .cse8 (mod (+ c_~var_1_31~0 (* v_y_82 4294967040) .cse18) 4294967296))))) (or (forall ((v_y_82 Int)) (let ((.cse19 (* v_y_82 256))) (or (< .cse5 .cse19) (< (mod (+ c_~var_1_31~0 (* v_y_82 4294967040) .cse18) 4294967296) .cse7) (< (+ .cse19 .cse8) .cse2) (< (+ .cse19 4) .cse5)))) .cse9)) .cse20)))))) (or .cse24 (< .cse5 c_~var_1_32~0)))) (or (and (or (let ((.cse31 (and (or (forall ((v_y_82 Int)) (let ((.cse34 (* v_y_82 256))) (or (< (+ c_~var_1_29~0 .cse34 4) c_~var_1_31~0) (< c_~var_1_31~0 (+ c_~var_1_29~0 .cse34)) (< (mod (+ .cse28 c_~var_1_31~0 (* v_y_82 4294967040) c_~var_1_38~0) 4294967296) .cse7) (< (+ c_~var_1_29~0 .cse34 .cse8) .cse29)))) .cse9) (forall ((v_y_82 Int)) (let ((.cse35 (* v_y_82 256))) (or (< (+ c_~var_1_29~0 .cse35 4) c_~var_1_31~0) (< c_~var_1_31~0 (+ c_~var_1_29~0 .cse35)) (< .cse8 (mod (+ .cse28 c_~var_1_31~0 (* v_y_82 4294967040) c_~var_1_38~0) 4294967296)) (< (+ c_~var_1_29~0 .cse35 .cse8) .cse29) (< (+ c_~var_1_31~0 c_~var_1_38~0) (+ (* (div (+ c_~var_1_31~0 .cse26 (* v_y_82 (- 256)) c_~var_1_38~0) 4294967296) 4294967296) c_~var_1_29~0 .cse11 .cse35 1)))))))) (and (or .cse13 (and (or (and (forall ((v_y_82 Int)) (let ((.cse27 (* v_y_82 256))) (or (< .cse25 (+ (* (div (+ c_~var_1_31~0 c_~var_1_30~0 .cse26 (* v_y_82 (- 256))) 4294967296) 4294967296) c_~var_1_29~0 .cse11 .cse27 1)) (< (+ c_~var_1_29~0 .cse27 4) c_~var_1_31~0) (< c_~var_1_31~0 (+ c_~var_1_29~0 .cse27)) (< .cse8 (mod (+ .cse28 c_~var_1_31~0 c_~var_1_30~0 (* v_y_82 4294967040)) 4294967296)) (< (+ c_~var_1_29~0 .cse27 .cse8) .cse29)))) (or .cse9 (forall ((v_y_82 Int)) (let ((.cse30 (* v_y_82 256))) (or (< (mod (+ .cse28 c_~var_1_31~0 c_~var_1_30~0 (* v_y_82 4294967040)) 4294967296) .cse7) (< (+ c_~var_1_29~0 .cse30 4) c_~var_1_31~0) (< c_~var_1_31~0 (+ c_~var_1_29~0 .cse30)) (< (+ c_~var_1_29~0 .cse30 .cse8) .cse29)))))) .cse12) (or .cse4 .cse31))) (or .cse14 (and (or .cse20 (and (forall ((v_y_82 Int)) (let ((.cse32 (* v_y_82 256))) (or (< (+ c_~var_1_29~0 .cse32 4) c_~var_1_31~0) (< c_~var_1_31~0 (+ c_~var_1_29~0 .cse32)) (< c_~var_1_31~0 (+ .cse11 .cse32 (* (div (+ c_~var_1_31~0 (* v_y_82 (- 256))) 4294967296) 4294967296) 1)) (< (+ c_~var_1_29~0 .cse32 .cse8) .cse29) (< .cse8 (mod (+ c_~var_1_31~0 (* v_y_82 4294967040)) 4294967296))))) (or (forall ((v_y_82 Int)) (let ((.cse33 (* v_y_82 256))) (or (< (+ c_~var_1_29~0 .cse33 4) c_~var_1_31~0) (< c_~var_1_31~0 (+ c_~var_1_29~0 .cse33)) (< (mod (+ c_~var_1_31~0 (* v_y_82 4294967040)) 4294967296) .cse7) (< (+ c_~var_1_29~0 .cse33 .cse8) .cse29)))) .cse9))) (or .cse15 .cse31))))) (< .cse36 .cse29)) (or (< c_~var_1_31~0 .cse36) .cse24)) .cse37))))) (or (< c_~var_1_30~0 c_~var_1_32~0) (let ((.cse159 (div c_~var_1_30~0 256))) (let ((.cse53 (* (- 1) .cse8)) (.cse54 (* (- 256) .cse159))) (let ((.cse50 (* 4294967296 (div c_~var_1_38~0 4294967296))) (.cse57 (* (- 1) .cse11)) (.cse59 (* (- 1) .cse55)) (.cse49 (* (- 1) c_~var_1_30~0)) (.cse157 (* (div (+ c_~var_1_30~0 .cse54 .cse79) 4294967296) 4294967296)) (.cse114 (* (div (+ c_~var_1_30~0 .cse54) 4294967296) 4294967296)) (.cse62 (* 256 .cse159)) (.cse158 (* 4294967296 (div (+ c_~var_1_30~0 .cse54 .cse55) 4294967296))) (.cse131 (* (div (+ (- 1) .cse53 c_~var_1_30~0 .cse55) 256) 256))) (let ((.cse113 (+ 4 .cse131)) (.cse132 (+ .cse158 c_~var_1_30~0 1)) (.cse111 (+ .cse62 4)) (.cse156 (+ .cse158 c_~var_1_30~0)) (.cse97 (+ c_~var_1_30~0 .cse114 1)) (.cse52 (+ .cse62 .cse8)) (.cse148 (+ .cse157 c_~var_1_30~0)) (.cse63 (* 4294967296 (div (+ .cse62 .cse59 4294967295 .cse49) 4294967296))) (.cse153 (* 256 (div (+ .cse57 (- 1) c_~var_1_30~0 c_~var_1_38~0) 256))) (.cse64 (* (div (+ .cse62 .cse49 4) 4294967296) 4294967296)) (.cse154 (+ c_~var_1_30~0 .cse50 .cse55)) (.cse65 (+ c_~var_1_30~0 .cse55))) (let ((.cse47 (* (div .cse65 256) 256)) (.cse61 (< (+ .cse63 .cse153 .cse64 .cse8) .cse154)) (.cse105 (+ c_~var_1_30~0 .cse92)) (.cse103 (* c_~var_1_30~0 2)) (.cse99 (* (div c_~var_1_30~0 4294967296) 4294967296)) (.cse96 (+ (* 256 (div (+ (- 1) .cse53 c_~var_1_30~0 .cse92) 256)) .cse8)) (.cse104 (+ .cse62 .cse64 .cse8)) (.cse80 (< (+ (* 256 (div (+ (- 1) .cse53 c_~var_1_30~0 .cse79) 256)) 4) .cse148)) (.cse82 (< .cse52 (+ .cse157 c_~var_1_30~0 1))) (.cse95 (< .cse52 .cse97)) (.cse91 (+ c_~var_1_30~0 .cse79)) (.cse76 (* (div c_~var_1_29~0 4294967296) 4294967296)) (.cse66 (< .cse111 .cse156)) (.cse67 (< .cse52 .cse132)) (.cse68 (< .cse113 .cse156)) (.cse48 (* (div (+ .cse57 c_~var_1_30~0 c_~var_1_38~0 (- 4294967297)) 256) 256)) (.cse58 (* (- 1) c_~var_1_31~0)) (.cse74 (+ c_~var_1_30~0 c_~var_1_29~0))) (and (or .cse1 (let ((.cse120 (div .cse5 256))) (let ((.cse60 (* 256 .cse120))) (let ((.cse84 (+ .cse60 4))) (let ((.cse81 (< .cse111 c_~var_1_30~0)) (.cse72 (+ .cse60 .cse8)) (.cse71 (< .cse84 .cse5)) (.cse69 (* (div (+ (- 1) .cse53 c_~var_1_31~0 c_~var_1_29~0 .cse55) 256) 256)) (.cse86 (* (- 256) .cse120)) (.cse56 (< c_~var_1_30~0 .cse2)) (.cse70 (+ c_~var_1_31~0 c_~var_1_29~0 .cse55)) (.cse46 (< .cse5 c_~var_1_30~0))) (and (or .cse14 (and (or .cse15 (and (let ((.cse51 (* (div (+ .cse53 c_~var_1_30~0 .cse54 (- 4294967297) .cse55) 4294967296) 4294967296))) (or .cse46 (< (+ .cse47 (* 4294967296 (div (+ .cse48 .cse49 4) 4294967296))) (+ c_~var_1_30~0 4294967297 .cse50 .cse51)) (< .cse52 (+ c_~var_1_30~0 4294967297 .cse51)))) (or .cse56 (< (+ (* 4294967296 (div (+ .cse26 (* 256 (div (+ .cse57 (- 1) c_~var_1_31~0 c_~var_1_38~0 c_~var_1_29~0) 256)) 4 .cse58) 4294967296)) (* (div (+ .cse26 .cse59 4294967295 .cse60 .cse58) 4294967296) 4294967296) .cse60 .cse8) (+ c_~var_1_31~0 c_~var_1_29~0 .cse50 .cse55))) (or .cse46 .cse61 (< (+ .cse62 .cse63 .cse64 .cse8) .cse65)) (or .cse9 (and (or .cse66 .cse46 .cse67 .cse68) (or (< (+ (* (div (+ (- 1) .cse26 .cse69 .cse58 .cse8) 4294967296) 4294967296) 4294967295 .cse60) .cse70) .cse56 .cse71 (< .cse72 .cse2)))) (or .cse56 .cse71 (< (+ (* (div (+ (- 1) (* 256 (div (+ .cse57 c_~var_1_31~0 c_~var_1_38~0 c_~var_1_29~0 (- 4294967297)) 256)) .cse26 .cse58 .cse8) 4294967296) 4294967296) 4294967295 .cse60) (+ c_~var_1_31~0 c_~var_1_29~0 .cse50))))) (or (and (or .cse46 (forall ((v_y_116 Int) (v_y_82 Int)) (let ((.cse75 (* v_y_116 4294967296)) (.cse73 (* v_y_82 256))) (or (< c_~var_1_30~0 .cse73) (< .cse74 (+ .cse75 .cse76 4294967297 .cse11 .cse73)) (< (+ .cse73 .cse8) .cse0) (< (+ .cse75 4294967295 .cse73) c_~var_1_30~0) (< (+ .cse73 4) c_~var_1_30~0))))) (or (forall ((v_y_116 Int) (v_y_82 Int)) (let ((.cse77 (* v_y_116 4294967296)) (.cse78 (* v_y_82 256))) (or (< .cse16 (+ .cse77 .cse76 .cse11 .cse78 1)) (< .cse5 (+ .cse77 .cse78)) (< (+ .cse77 4294967295 .cse78) (+ c_~var_1_31~0 c_~var_1_29~0 .cse79)) (< .cse5 .cse78) (< (+ .cse78 4) .cse5) (< .cse8 (mod (+ c_~var_1_31~0 (* v_y_82 4294967040) .cse18) 4294967296))))) .cse56) (or (and (or .cse46 .cse80 .cse81 .cse82) (let ((.cse85 (* (div (+ c_~var_1_31~0 c_~var_1_29~0 .cse79 .cse86) 4294967296) 4294967296))) (let ((.cse83 (+ c_~var_1_31~0 c_~var_1_29~0 .cse85 1))) (or .cse56 (< .cse72 .cse83) (< (+ (* (div (+ (- 1) .cse53 c_~var_1_31~0 c_~var_1_29~0 .cse79) 256) 256) .cse8) .cse83) (< .cse84 (+ c_~var_1_31~0 c_~var_1_29~0 .cse85)))))) .cse9) (or .cse56 (forall ((v_y_116 Int) (v_y_82 Int)) (let ((.cse87 (* v_y_116 4294967296)) (.cse88 (* v_y_82 256))) (or (< (+ .cse87 4294967295 .cse88) .cse5) (< .cse5 .cse88) (< (+ .cse88 .cse8) .cse2) (< (+ .cse88 4) .cse5) (< .cse16 (+ .cse87 .cse76 4294967297 .cse11 .cse88)))))) (or .cse46 (forall ((v_y_116 Int) (v_y_82 Int)) (let ((.cse89 (* v_y_116 4294967296)) (.cse90 (* v_y_82 256))) (or (< .cse74 (+ .cse89 .cse76 .cse11 .cse90 1)) (< .cse8 (mod (+ c_~var_1_30~0 (* v_y_82 4294967040) c_~var_1_29~0) 4294967296)) (< c_~var_1_30~0 .cse90) (< c_~var_1_30~0 (+ .cse89 .cse90)) (< (+ .cse90 4) c_~var_1_30~0) (< (+ .cse89 4294967295 .cse90) .cse91)))))) .cse20))) (or .cse13 (and (or .cse12 (let ((.cse102 (* (- 1) .cse92))) (and (or (and (let ((.cse94 (* (div (+ c_~var_1_31~0 c_~var_1_29~0 .cse86 .cse92) 4294967296) 4294967296))) (let ((.cse93 (+ c_~var_1_31~0 c_~var_1_29~0 .cse94))) (or .cse56 (< (+ (* 256 (div (+ (- 1) .cse53 c_~var_1_31~0 c_~var_1_29~0 .cse92) 256)) 4) .cse93) (< .cse72 (+ c_~var_1_31~0 c_~var_1_29~0 .cse94 1)) (< .cse84 .cse93)))) (or .cse95 .cse46 (< .cse96 .cse97) .cse81)) .cse9) (let ((.cse98 (* 256 (div (+ .cse57 c_~var_1_31~0 c_~var_1_30~0 c_~var_1_29~0 (- 4294967297)) 256))) (.cse100 (* (div (+ c_~var_1_31~0 c_~var_1_29~0 .cse86) 4294967296) 4294967296))) (or .cse56 (< (+ .cse98 4) (+ c_~var_1_31~0 .cse99 c_~var_1_29~0 .cse100)) (< (+ .cse98 .cse8) (+ c_~var_1_31~0 .cse99 c_~var_1_29~0 1 .cse100)))) (let ((.cse101 (* (div (+ .cse102 .cse26 4294967295 .cse60 .cse58) 4294967296) 4294967296))) (or .cse56 .cse71 (< (+ .cse101 .cse60 .cse8) (+ c_~var_1_31~0 c_~var_1_29~0 .cse92)) (< (+ .cse101 (* (div (+ (- 1) .cse26 .cse60 .cse58 .cse8) 4294967296) 4294967296) 4294967295 .cse60) .cse5) (< (+ .cse101 (* 256 (div (+ .cse57 (- 1) c_~var_1_31~0 c_~var_1_30~0 c_~var_1_29~0) 256)) .cse8) (+ c_~var_1_31~0 .cse99 c_~var_1_29~0 .cse92)))) (or (< (+ .cse62 4294967295 (* (div (+ .cse102 .cse49 (* (div (+ .cse57 (- 1) .cse103) 256) 256) .cse8) 4294967296) 4294967296) .cse64) (+ .cse99 c_~var_1_30~0)) (< .cse104 .cse105) .cse46)))) (or (let ((.cse108 (+ c_~var_1_30~0 c_~var_1_38~0))) (and (or .cse46 (forall ((v_y_82 Int) (v_y_122 Int)) (let ((.cse107 (* v_y_122 4294967296)) (.cse106 (* v_y_82 256))) (or (< c_~var_1_30~0 .cse106) (< (+ 4294967295 .cse107 .cse106) c_~var_1_30~0) (< (+ .cse106 .cse8) .cse0) (< (+ .cse106 4) c_~var_1_30~0) (< .cse108 (+ 4294967297 .cse50 .cse11 .cse107 .cse106)))))) (or .cse56 (forall ((v_y_82 Int) (v_y_122 Int)) (let ((.cse110 (* v_y_122 4294967296)) (.cse109 (* v_y_82 256))) (or (< .cse5 .cse109) (< (+ 4294967295 .cse110 .cse109) .cse5) (< (+ .cse109 .cse8) .cse2) (< .cse22 (+ 4294967297 .cse50 .cse11 .cse110 .cse109)) (< (+ .cse109 4) .cse5))))) (or (and (let ((.cse112 (+ c_~var_1_30~0 .cse114))) (or .cse95 .cse46 (< .cse111 .cse112) (< (+ .cse62 4294967295) .cse65) (< .cse113 .cse112))) (let ((.cse115 (* (div (+ c_~var_1_31~0 c_~var_1_29~0 .cse86 .cse55) 4294967296) 4294967296))) (or .cse56 (< .cse72 (+ c_~var_1_31~0 .cse115 c_~var_1_29~0 1)) .cse71 (< (+ .cse69 4) (+ c_~var_1_31~0 .cse115 c_~var_1_29~0))))) .cse9) (or .cse56 (forall ((v_y_82 Int) (v_y_122 Int)) (let ((.cse116 (* v_y_122 4294967296)) (.cse117 (* v_y_82 256))) (or (< (+ 4294967295 .cse116 .cse117) .cse70) (< .cse5 .cse117) (< .cse5 (+ .cse116 .cse117)) (< (+ .cse117 4) .cse5) (< .cse22 (+ .cse50 .cse11 .cse116 .cse117 1)) (< .cse8 (mod (+ c_~var_1_31~0 (* v_y_82 4294967040) c_~var_1_38~0 c_~var_1_29~0) 4294967296)))))) (or .cse46 (forall ((v_y_82 Int) (v_y_122 Int)) (let ((.cse118 (* v_y_122 4294967296)) (.cse119 (* v_y_82 256))) (or (< c_~var_1_30~0 (+ .cse118 .cse119)) (< .cse108 (+ .cse50 .cse11 .cse118 .cse119 1)) (< c_~var_1_30~0 .cse119) (< (+ 4294967295 .cse118 .cse119) .cse65) (< (+ .cse119 4) c_~var_1_30~0) (< .cse8 (mod (+ c_~var_1_30~0 (* v_y_82 4294967040) c_~var_1_38~0) 4294967296)))))))) .cse4))))))))) (or (let ((.cse155 (div (+ c_~var_1_31~0 .cse26) 256))) (let ((.cse151 (* .cse155 (- 256))) (.cse121 (* .cse155 256))) (let ((.cse140 (< (+ .cse121 c_~var_1_29~0 4) c_~var_1_31~0)) (.cse123 (< .cse74 .cse29)) (.cse124 (+ .cse121 c_~var_1_29~0 .cse8)) (.cse152 (* (div (+ c_~var_1_31~0 .cse151 .cse26 .cse55) 4294967296) 4294967296))) (let ((.cse129 (* 4294967296 (div (+ c_~var_1_31~0 .cse151 .cse26) 4294967296))) (.cse125 (* (div (+ .cse62 4294967295 .cse49) 4294967296) 4294967296)) (.cse126 (+ 4294967292 c_~var_1_30~0 .cse114)) (.cse122 (* (div (+ .cse57 (- 1) c_~var_1_31~0 .cse26 c_~var_1_38~0) 256) 256)) (.cse130 (or (< (+ c_~var_1_29~0 (* (div (+ (- 1) .cse53 c_~var_1_31~0 .cse26 .cse55) 256) 256) 4) (+ c_~var_1_31~0 .cse152)) .cse140 .cse123 (< .cse124 (+ c_~var_1_31~0 .cse152 1)))) (.cse128 (* (div (+ .cse57 c_~var_1_31~0 .cse26 c_~var_1_38~0 (- 4294967297)) 256) 256)) (.cse127 (< c_~var_1_31~0 .cse74))) (and (or .cse13 (and (or .cse4 (and (or (< (+ .cse121 c_~var_1_29~0 (* 4294967296 (div (+ c_~var_1_29~0 .cse122 4 .cse58) 4294967296)) 4294967295) (+ c_~var_1_31~0 .cse50 .cse55)) .cse123 (< .cse124 (+ c_~var_1_31~0 .cse55))) (or (< (+ .cse125 .cse48 .cse8) (+ c_~var_1_30~0 .cse114 .cse50 1)) (< .cse47 .cse126) .cse127) (or .cse61 (< .cse104 .cse65) .cse127) (or (< (+ .cse128 c_~var_1_29~0 .cse8) (+ .cse129 c_~var_1_31~0 .cse50 1)) (< (+ .cse128 c_~var_1_29~0 4294967295 (* (div (+ (- 4294967292) c_~var_1_29~0 (* (div (+ c_~var_1_31~0 .cse26 .cse55) 256) 256) .cse58) 4294967296) 4294967296)) (+ .cse129 c_~var_1_31~0 .cse50)) .cse123) (or (and .cse130 (or .cse66 (< (+ .cse131 .cse8) .cse132) .cse67 .cse127)) .cse9))) (or .cse12 (let ((.cse139 (+ c_~var_1_31~0 .cse92))) (and (or (forall ((v_y_91 Int) (v_y_82 Int)) (let ((.cse134 (* v_y_91 4294967296)) (.cse133 (* v_y_82 256))) (or (< (+ c_~var_1_29~0 .cse133 4) c_~var_1_31~0) (< c_~var_1_31~0 (+ c_~var_1_29~0 .cse133)) (< (+ c_~var_1_29~0 .cse134 4294967295 .cse133) c_~var_1_31~0) (< (+ c_~var_1_29~0 .cse133 .cse8) .cse29) (< .cse25 (+ .cse99 c_~var_1_29~0 .cse134 4294967297 .cse11 .cse133))))) .cse123) (or (forall ((v_y_91 Int) (v_y_82 Int)) (let ((.cse136 (* v_y_91 4294967296)) (.cse135 (* v_y_82 256))) (or (< c_~var_1_30~0 .cse135) (< (+ .cse136 4294967295 .cse135) .cse105) (< .cse8 (* 2 (mod (+ c_~var_1_30~0 (* v_y_82 2147483520)) 2147483648))) (< (+ .cse135 4) c_~var_1_30~0) (< .cse103 (+ .cse99 .cse136 .cse11 .cse135 1))))) .cse127) (or (forall ((v_y_91 Int) (v_y_82 Int)) (let ((.cse137 (* v_y_91 4294967296)) (.cse138 (* v_y_82 256))) (or (< .cse25 (+ .cse99 c_~var_1_29~0 .cse137 .cse11 .cse138 1)) (< (+ c_~var_1_29~0 .cse138 4) c_~var_1_31~0) (< c_~var_1_31~0 (+ c_~var_1_29~0 .cse138)) (< .cse8 (mod (+ .cse28 c_~var_1_31~0 c_~var_1_30~0 (* v_y_82 4294967040)) 4294967296)) (< c_~var_1_31~0 (+ c_~var_1_29~0 .cse137 .cse138)) (< (+ c_~var_1_29~0 .cse138 .cse8) .cse29) (< (+ c_~var_1_29~0 .cse137 4294967295 .cse138) .cse139)))) .cse123) (or (and (let ((.cse141 (+ .cse129 c_~var_1_31~0 1))) (or (< (+ .cse121 c_~var_1_29~0 4294967295) .cse139) .cse140 .cse123 (< .cse124 .cse141) (< (+ c_~var_1_29~0 (* 256 (div (+ (- 1) .cse53 c_~var_1_31~0 .cse26 .cse92) 256)) .cse8) .cse141))) (let ((.cse142 (* (div (+ c_~var_1_30~0 .cse54 .cse92) 4294967296) 4294967296))) (let ((.cse143 (+ c_~var_1_30~0 .cse142 1))) (or (< .cse111 (+ c_~var_1_30~0 .cse142)) (< .cse52 .cse143) (< .cse96 .cse143) .cse127)))) .cse9)))))) (or (let ((.cse145 (+ (* (div (+ .cse121 c_~var_1_29~0 4 .cse58) 4294967296) 4294967296) .cse121 c_~var_1_29~0 .cse8)) (.cse150 (* (div (+ (- 1) .cse121 c_~var_1_29~0 .cse58 .cse8) 4294967296) 4294967296))) (and (or (let ((.cse144 (* (div (+ c_~var_1_31~0 .cse151 .cse26 .cse79) 4294967296) 4294967296)) (.cse146 (+ c_~var_1_30~0 .cse76 .cse79))) (and (or (< (+ (* 256 (div (+ .cse57 (- 1) c_~var_1_31~0) 256)) c_~var_1_29~0 4) (+ c_~var_1_31~0 .cse144 .cse76)) .cse123 (< .cse145 (+ c_~var_1_31~0 .cse144 .cse79))) (or (< (+ (* 4294967296 (div (+ .cse62 (* (- 1) .cse79) 4294967295 .cse49) 4294967296)) (* 256 (div (+ .cse57 (- 1) c_~var_1_30~0 c_~var_1_29~0) 256)) .cse8) .cse146) (< .cse104 .cse91) .cse127) (or (and (let ((.cse147 (+ c_~var_1_31~0 .cse144 1))) (or .cse140 .cse123 (< (+ c_~var_1_29~0 (* 256 (div (+ (- 1) .cse53 c_~var_1_31~0 .cse26 .cse79) 256)) .cse8) .cse147) (< .cse124 .cse147))) (or (< .cse111 .cse148) .cse80 .cse82 .cse127)) .cse9) (let ((.cse149 (* (div (+ .cse57 c_~var_1_31~0 (- 4294967297)) 256) 256))) (or (< (+ .cse149 c_~var_1_29~0 4294967296 .cse150 .cse8) (+ .cse129 c_~var_1_31~0 .cse76 .cse79)) (< (+ .cse149 c_~var_1_29~0 4) (+ .cse129 c_~var_1_31~0 .cse76)) .cse123)) (or .cse95 (< (+ (* 256 (div (+ .cse57 c_~var_1_30~0 c_~var_1_29~0 (- 4294967297)) 256)) .cse125 4294967296 .cse8) .cse146) (< (* 256 (div .cse91 256)) .cse126) .cse127))) .cse20) (or .cse15 (and (or (< .cse145 (+ c_~var_1_31~0 .cse152 .cse55)) .cse123 (< (+ c_~var_1_29~0 .cse122 4) (+ c_~var_1_31~0 .cse152 .cse50))) (or .cse9 (and (or .cse66 .cse67 .cse68 .cse127) .cse130)) (or (< (+ .cse62 .cse63 .cse8) .cse65) (< (+ .cse62 4294967295 (* (div (+ .cse153 .cse49 4) 4294967296) 4294967296)) .cse154) .cse127) (or (< (+ .cse121 c_~var_1_29~0 4294967295 (* (div (+ .cse128 c_~var_1_29~0 4 .cse58) 4294967296) 4294967296)) (+ c_~var_1_31~0 .cse50)) (< (+ .cse121 c_~var_1_29~0 4294967295 .cse150) c_~var_1_31~0) .cse123) (or (< (+ .cse62 4294967295 .cse64) c_~var_1_30~0) (< (+ .cse62 4294967295 (* (div (+ (- 1) .cse48 .cse49 .cse8) 4294967296) 4294967296)) (+ c_~var_1_30~0 .cse50)) .cse127))))) .cse14)))))) .cse37)))))))))))) is different from false [2023-12-19 13:23:14,001 WARN L293 SmtUtils]: Spent 2.68m on a formula simplification that was a NOOP. DAG size: 788 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-19 13:28:17,602 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-19 13:28:17,603 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-19 13:28:18,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-19 13:28:18,753 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 13:28:18,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 13:28:18,754 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 351 with TraceHistMax 55,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-19 13:28:18,756 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:28:18,758 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 13:28:18,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:28:18 BoogieIcfgContainer [2023-12-19 13:28:18,759 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 13:28:18,759 INFO L158 Benchmark]: Toolchain (without parser) took 877798.11ms. Allocated memory was 277.9MB in the beginning and 702.5MB in the end (delta: 424.7MB). Free memory was 223.8MB in the beginning and 297.6MB in the end (delta: -73.8MB). Peak memory consumption was 420.2MB. Max. memory is 8.0GB. [2023-12-19 13:28:18,760 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 165.7MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 13:28:18,760 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.28ms. Allocated memory is still 277.9MB. Free memory was 223.4MB in the beginning and 198.6MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-19 13:28:18,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.54ms. Allocated memory is still 277.9MB. Free memory was 198.6MB in the beginning and 189.8MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-19 13:28:18,760 INFO L158 Benchmark]: Boogie Preprocessor took 119.47ms. Allocated memory is still 277.9MB. Free memory was 189.8MB in the beginning and 232.4MB in the end (delta: -42.6MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. [2023-12-19 13:28:18,760 INFO L158 Benchmark]: RCFGBuilder took 665.94ms. Allocated memory is still 277.9MB. Free memory was 231.9MB in the beginning and 176.9MB in the end (delta: 55.0MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2023-12-19 13:28:18,760 INFO L158 Benchmark]: TraceAbstraction took 876560.37ms. Allocated memory was 277.9MB in the beginning and 702.5MB in the end (delta: 424.7MB). Free memory was 176.3MB in the beginning and 297.6MB in the end (delta: -121.2MB). Peak memory consumption was 372.9MB. Max. memory is 8.0GB. [2023-12-19 13:28:18,761 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.09ms. Allocated memory is still 165.7MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 366.28ms. Allocated memory is still 277.9MB. Free memory was 223.4MB in the beginning and 198.6MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.54ms. Allocated memory is still 277.9MB. Free memory was 198.6MB in the beginning and 189.8MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 119.47ms. Allocated memory is still 277.9MB. Free memory was 189.8MB in the beginning and 232.4MB in the end (delta: -42.6MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. * RCFGBuilder took 665.94ms. Allocated memory is still 277.9MB. Free memory was 231.9MB in the beginning and 176.9MB in the end (delta: 55.0MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * TraceAbstraction took 876560.37ms. Allocated memory was 277.9MB in the beginning and 702.5MB in the end (delta: 424.7MB). Free memory was 176.3MB in the beginning and 297.6MB in the end (delta: -121.2MB). Peak memory consumption was 372.9MB. Max. memory is 8.0GB. * 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 351 with TraceHistMax 55,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 153 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 876.5s, OverallIterations: 9, TraceHistogramMax: 55, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2964 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2842 mSDsluCounter, 5846 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3674 mSDsCounter, 995 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4078 IncrementalHoareTripleChecker+Invalid, 5073 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 995 mSolverCounterUnsat, 2172 mSDtfsCounter, 4078 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4286 GetRequests, 4120 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3157 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=637occurred in iteration=8, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 680 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 3132 NumberOfCodeBlocks, 3132 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 4167 ConstructedInterpolants, 5 QuantifiedInterpolants, 14310 SizeOfPredicates, 35 NumberOfNonLiveVariables, 6687 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 70266/71280 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: Timeout Completed graceful shutdown