/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 20:57:23,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 20:57:23,733 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-20 20:57:23,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 20:57:23,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 20:57:23,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 20:57:23,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 20:57:23,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 20:57:23,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 20:57:23,772 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 20:57:23,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 20:57:23,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 20:57:23,773 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 20:57:23,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 20:57:23,774 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 20:57:23,774 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 20:57:23,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 20:57:23,775 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 20:57:23,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 20:57:23,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 20:57:23,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 20:57:23,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 20:57:23,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 20:57:23,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 20:57:23,776 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 20:57:23,776 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 20:57:23,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 20:57:23,776 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 20:57:23,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 20:57:23,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 20:57:23,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 20:57:23,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 20:57:23,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 20:57:23,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 20:57:23,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 20:57:23,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 20:57:23,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 20:57:23,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 20:57:23,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 20:57:23,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 20:57:23,779 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 20:57:23,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 20:57:23,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 20:57:23,779 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 -> false [2023-12-20 20:57:23,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 20:57:23,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 20:57:23,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 20:57:23,952 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 20:57:23,952 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 20:57:23,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i [2023-12-20 20:57:24,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 20:57:25,148 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 20:57:25,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i [2023-12-20 20:57:25,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dea7d45a/1324bfb3d619442ab9f10264e05829ac/FLAG46bbf9e8f [2023-12-20 20:57:25,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dea7d45a/1324bfb3d619442ab9f10264e05829ac [2023-12-20 20:57:25,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 20:57:25,177 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 20:57:25,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 20:57:25,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 20:57:25,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 20:57:25,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 08:57:25" (1/1) ... [2023-12-20 20:57:25,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a75576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25, skipping insertion in model container [2023-12-20 20:57:25,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 08:57:25" (1/1) ... [2023-12-20 20:57:25,213 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 20:57:25,335 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_fillercode_fillercodestructure_filler-pr-ci_file-10.i[919,932] [2023-12-20 20:57:25,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 20:57:25,395 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 20:57:25,402 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_fillercode_fillercodestructure_filler-pr-ci_file-10.i[919,932] [2023-12-20 20:57:25,449 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 20:57:25,475 INFO L206 MainTranslator]: Completed translation [2023-12-20 20:57:25,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25 WrapperNode [2023-12-20 20:57:25,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 20:57:25,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 20:57:25,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 20:57:25,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 20:57:25,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25" (1/1) ... [2023-12-20 20:57:25,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25" (1/1) ... [2023-12-20 20:57:25,541 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 258 [2023-12-20 20:57:25,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 20:57:25,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 20:57:25,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 20:57:25,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 20:57:25,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25" (1/1) ... [2023-12-20 20:57:25,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25" (1/1) ... [2023-12-20 20:57:25,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25" (1/1) ... [2023-12-20 20:57:25,577 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-20 20:57:25,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25" (1/1) ... [2023-12-20 20:57:25,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25" (1/1) ... [2023-12-20 20:57:25,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25" (1/1) ... [2023-12-20 20:57:25,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25" (1/1) ... [2023-12-20 20:57:25,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25" (1/1) ... [2023-12-20 20:57:25,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25" (1/1) ... [2023-12-20 20:57:25,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 20:57:25,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 20:57:25,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 20:57:25,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 20:57:25,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25" (1/1) ... [2023-12-20 20:57:25,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 20:57:25,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:57:25,649 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-20 20:57:25,655 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-20 20:57:25,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 20:57:25,670 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 20:57:25,670 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 20:57:25,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 20:57:25,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 20:57:25,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 20:57:25,763 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 20:57:25,767 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 20:57:26,127 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 20:57:26,161 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 20:57:26,161 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 20:57:26,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 08:57:26 BoogieIcfgContainer [2023-12-20 20:57:26,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 20:57:26,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 20:57:26,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 20:57:26,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 20:57:26,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 08:57:25" (1/3) ... [2023-12-20 20:57:26,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3508843a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 08:57:26, skipping insertion in model container [2023-12-20 20:57:26,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:57:25" (2/3) ... [2023-12-20 20:57:26,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3508843a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 08:57:26, skipping insertion in model container [2023-12-20 20:57:26,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 08:57:26" (3/3) ... [2023-12-20 20:57:26,172 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i [2023-12-20 20:57:26,184 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 20:57:26,185 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 20:57:26,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 20:57:26,223 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;@592855cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 20:57:26,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 20:57:26,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-20 20:57:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-12-20 20:57:26,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:57:26,238 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:57:26,239 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:57:26,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:57:26,243 INFO L85 PathProgramCache]: Analyzing trace with hash -999745132, now seen corresponding path program 1 times [2023-12-20 20:57:26,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:57:26,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736227598] [2023-12-20 20:57:26,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:57:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:57:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:57:26,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:57:26,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736227598] [2023-12-20 20:57:26,424 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-20 20:57:26,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152654083] [2023-12-20 20:57:26,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:57:26,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:57:26,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:57:26,465 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-20 20:57:26,466 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-20 20:57:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:57:26,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-20 20:57:26,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:57:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2023-12-20 20:57:26,724 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 20:57:26,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152654083] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 20:57:26,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 20:57:26,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 20:57:26,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013991665] [2023-12-20 20:57:26,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:57:26,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 20:57:26,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:57:26,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 20:57:26,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 20:57:26,756 INFO L87 Difference]: Start difference. First operand has 97 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2023-12-20 20:57:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:57:26,784 INFO L93 Difference]: Finished difference Result 191 states and 344 transitions. [2023-12-20 20:57:26,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 20:57:26,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 214 [2023-12-20 20:57:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:57:26,791 INFO L225 Difference]: With dead ends: 191 [2023-12-20 20:57:26,791 INFO L226 Difference]: Without dead ends: 95 [2023-12-20 20:57:26,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 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-20 20:57:26,796 INFO L413 NwaCegarLoop]: 148 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, 148 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-20 20:57:26,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 20:57:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-20 20:57:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-12-20 20:57:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-20 20:57:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 151 transitions. [2023-12-20 20:57:26,850 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 151 transitions. Word has length 214 [2023-12-20 20:57:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:57:26,850 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 151 transitions. [2023-12-20 20:57:26,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2023-12-20 20:57:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 151 transitions. [2023-12-20 20:57:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-12-20 20:57:26,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:57:26,855 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:57:26,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-20 20:57:27,056 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-20 20:57:27,057 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:57:27,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:57:27,057 INFO L85 PathProgramCache]: Analyzing trace with hash -952373156, now seen corresponding path program 1 times [2023-12-20 20:57:27,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:57:27,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003165338] [2023-12-20 20:57:27,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:57:27,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:57:27,145 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:57:27,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995000402] [2023-12-20 20:57:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:57:27,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:57:27,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:57:27,149 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-20 20:57:27,152 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-20 20:57:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:57:27,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 20:57:27,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:57:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:57:27,597 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 20:57:27,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:57:27,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003165338] [2023-12-20 20:57:27,598 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:57:27,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995000402] [2023-12-20 20:57:27,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995000402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 20:57:27,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 20:57:27,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 20:57:27,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036139211] [2023-12-20 20:57:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:57:27,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 20:57:27,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:57:27,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 20:57:27,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 20:57:27,602 INFO L87 Difference]: Start difference. First operand 95 states and 151 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:57:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:57:27,730 INFO L93 Difference]: Finished difference Result 284 states and 452 transitions. [2023-12-20 20:57:27,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 20:57:27,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2023-12-20 20:57:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:57:27,734 INFO L225 Difference]: With dead ends: 284 [2023-12-20 20:57:27,734 INFO L226 Difference]: Without dead ends: 190 [2023-12-20 20:57:27,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 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-20 20:57:27,735 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 86 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 20:57:27,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 425 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 20:57:27,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-12-20 20:57:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 155. [2023-12-20 20:57:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-20 20:57:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 244 transitions. [2023-12-20 20:57:27,757 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 244 transitions. Word has length 214 [2023-12-20 20:57:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:57:27,758 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 244 transitions. [2023-12-20 20:57:27,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:57:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2023-12-20 20:57:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-20 20:57:27,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:57:27,760 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:57:27,782 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-20 20:57:27,966 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-20 20:57:27,967 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:57:27,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:57:27,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2072544216, now seen corresponding path program 1 times [2023-12-20 20:57:27,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:57:27,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284095752] [2023-12-20 20:57:27,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:57:27,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:57:27,997 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:57:27,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1404960825] [2023-12-20 20:57:27,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:57:27,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:57:27,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:57:27,999 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-20 20:57:28,028 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-20 20:57:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:57:28,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-20 20:57:28,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:57:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1193 proven. 489 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2023-12-20 20:57:39,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 20:58:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:58:04,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:58:04,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284095752] [2023-12-20 20:58:04,723 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:58:04,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404960825] [2023-12-20 20:58:04,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404960825] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 20:58:04,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 20:58:04,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [39] total 51 [2023-12-20 20:58:04,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383571058] [2023-12-20 20:58:04,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:58:04,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 20:58:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:58:04,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 20:58:04,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=2095, Unknown=0, NotChecked=0, Total=2550 [2023-12-20 20:58:04,726 INFO L87 Difference]: Start difference. First operand 155 states and 244 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:58:10,885 WARN L293 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 155 DAG size of output: 154 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 20:58:30,342 WARN L293 SmtUtils]: Spent 9.93s on a formula simplification. DAG size of input: 175 DAG size of output: 176 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 20:59:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:59:03,351 INFO L93 Difference]: Finished difference Result 457 states and 703 transitions. [2023-12-20 20:59:03,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-20 20:59:03,352 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2023-12-20 20:59:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:59:03,356 INFO L225 Difference]: With dead ends: 457 [2023-12-20 20:59:03,356 INFO L226 Difference]: Without dead ends: 363 [2023-12-20 20:59:03,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3215 ImplicationChecksByTransitivity, 61.7s TimeCoverageRelationStatistics Valid=1114, Invalid=7628, Unknown=0, NotChecked=0, Total=8742 [2023-12-20 20:59:03,359 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 844 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-20 20:59:03,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1111 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-20 20:59:03,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-12-20 20:59:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 180. [2023-12-20 20:59:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 109 states have (on average 1.385321100917431) internal successors, (151), 109 states have internal predecessors, (151), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-20 20:59:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 287 transitions. [2023-12-20 20:59:03,391 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 287 transitions. Word has length 215 [2023-12-20 20:59:03,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:59:03,391 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 287 transitions. [2023-12-20 20:59:03,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:59:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 287 transitions. [2023-12-20 20:59:03,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-20 20:59:03,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:59:03,402 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:59:03,420 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-20 20:59:03,620 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-20 20:59:03,623 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:59:03,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:59:03,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1521358502, now seen corresponding path program 1 times [2023-12-20 20:59:03,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:59:03,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330396313] [2023-12-20 20:59:03,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:59:03,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:59:03,647 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:59:03,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [745928828] [2023-12-20 20:59:03,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:59:03,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:59:03,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:59:03,669 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-20 20:59:03,669 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-20 20:59:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:59:03,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-20 20:59:03,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:59:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:59:14,404 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 20:59:14,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:59:14,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330396313] [2023-12-20 20:59:14,404 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:59:14,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745928828] [2023-12-20 20:59:14,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745928828] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 20:59:14,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 20:59:14,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-20 20:59:14,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456113924] [2023-12-20 20:59:14,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:59:14,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 20:59:14,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:59:14,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 20:59:14,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-12-20 20:59:14,406 INFO L87 Difference]: Start difference. First operand 180 states and 287 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:59:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:59:15,422 INFO L93 Difference]: Finished difference Result 558 states and 874 transitions. [2023-12-20 20:59:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-20 20:59:15,423 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2023-12-20 20:59:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:59:15,428 INFO L225 Difference]: With dead ends: 558 [2023-12-20 20:59:15,428 INFO L226 Difference]: Without dead ends: 439 [2023-12-20 20:59:15,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2023-12-20 20:59:15,434 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 495 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-20 20:59:15,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 876 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-20 20:59:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-12-20 20:59:15,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 322. [2023-12-20 20:59:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 215 states have (on average 1.4186046511627908) internal successors, (305), 216 states have internal predecessors, (305), 102 states have call successors, (102), 4 states have call predecessors, (102), 4 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2023-12-20 20:59:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 509 transitions. [2023-12-20 20:59:15,482 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 509 transitions. Word has length 215 [2023-12-20 20:59:15,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:59:15,483 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 509 transitions. [2023-12-20 20:59:15,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:59:15,483 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 509 transitions. [2023-12-20 20:59:15,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-20 20:59:15,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:59:15,485 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:59:15,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 20:59:15,691 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-20 20:59:15,692 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:59:15,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:59:15,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1084665052, now seen corresponding path program 1 times [2023-12-20 20:59:15,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:59:15,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450984603] [2023-12-20 20:59:15,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:59:15,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:59:15,713 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:59:15,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734724236] [2023-12-20 20:59:15,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:59:15,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:59:15,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:59:15,715 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-20 20:59:15,734 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-20 20:59:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:59:15,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 20:59:15,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:59:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:59:15,871 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 20:59:15,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:59:15,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450984603] [2023-12-20 20:59:15,871 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:59:15,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734724236] [2023-12-20 20:59:15,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734724236] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 20:59:15,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 20:59:15,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 20:59:15,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143543678] [2023-12-20 20:59:15,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:59:15,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 20:59:15,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:59:15,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 20:59:15,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-20 20:59:15,873 INFO L87 Difference]: Start difference. First operand 322 states and 509 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:59:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:59:15,958 INFO L93 Difference]: Finished difference Result 623 states and 976 transitions. [2023-12-20 20:59:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 20:59:15,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2023-12-20 20:59:15,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:59:15,969 INFO L225 Difference]: With dead ends: 623 [2023-12-20 20:59:15,969 INFO L226 Difference]: Without dead ends: 504 [2023-12-20 20:59:15,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-20 20:59:15,970 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 127 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 20:59:15,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 472 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 20:59:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2023-12-20 20:59:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 372. [2023-12-20 20:59:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 281 states have (on average 1.498220640569395) internal successors, (421), 283 states have internal predecessors, (421), 84 states have call successors, (84), 6 states have call predecessors, (84), 6 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-20 20:59:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 589 transitions. [2023-12-20 20:59:15,988 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 589 transitions. Word has length 215 [2023-12-20 20:59:15,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:59:15,988 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 589 transitions. [2023-12-20 20:59:15,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:59:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 589 transitions. [2023-12-20 20:59:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-20 20:59:15,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:59:15,990 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:59:15,999 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-20 20:59:16,197 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-20 20:59:16,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:59:16,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:59:16,198 INFO L85 PathProgramCache]: Analyzing trace with hash 275318426, now seen corresponding path program 1 times [2023-12-20 20:59:16,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:59:16,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670190668] [2023-12-20 20:59:16,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:59:16,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:59:16,218 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:59:16,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560167915] [2023-12-20 20:59:16,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:59:16,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:59:16,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:59:16,219 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-20 20:59:16,244 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-20 20:59:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:59:16,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 20:59:16,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:59:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 849 proven. 75 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2023-12-20 20:59:16,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 20:59:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2023-12-20 20:59:16,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:59:16,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670190668] [2023-12-20 20:59:16,648 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:59:16,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560167915] [2023-12-20 20:59:16,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560167915] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 20:59:16,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 20:59:16,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-20 20:59:16,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498923318] [2023-12-20 20:59:16,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 20:59:16,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 20:59:16,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:59:16,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 20:59:16,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 20:59:16,649 INFO L87 Difference]: Start difference. First operand 372 states and 589 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2023-12-20 20:59:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:59:16,819 INFO L93 Difference]: Finished difference Result 743 states and 1168 transitions. [2023-12-20 20:59:16,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 20:59:16,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 215 [2023-12-20 20:59:16,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:59:16,831 INFO L225 Difference]: With dead ends: 743 [2023-12-20 20:59:16,831 INFO L226 Difference]: Without dead ends: 384 [2023-12-20 20:59:16,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 422 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-20 20:59:16,833 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 59 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 20:59:16,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 247 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 20:59:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-12-20 20:59:16,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 375. [2023-12-20 20:59:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 282 states have (on average 1.4609929078014185) internal successors, (412), 284 states have internal predecessors, (412), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-20 20:59:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 580 transitions. [2023-12-20 20:59:16,857 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 580 transitions. Word has length 215 [2023-12-20 20:59:16,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:59:16,857 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 580 transitions. [2023-12-20 20:59:16,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2023-12-20 20:59:16,857 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 580 transitions. [2023-12-20 20:59:16,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-20 20:59:16,860 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:59:16,860 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:59:16,867 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-20 20:59:17,065 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-20 20:59:17,065 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:59:17,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:59:17,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1601818076, now seen corresponding path program 1 times [2023-12-20 20:59:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:59:17,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658587136] [2023-12-20 20:59:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:59:17,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:59:17,085 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:59:17,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2050228838] [2023-12-20 20:59:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:59:17,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:59:17,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:59:17,086 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-20 20:59:17,088 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-20 20:59:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:59:17,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 20:59:17,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:59:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 849 proven. 75 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2023-12-20 20:59:17,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 20:59:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2023-12-20 20:59:17,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:59:17,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658587136] [2023-12-20 20:59:17,521 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:59:17,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050228838] [2023-12-20 20:59:17,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050228838] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 20:59:17,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 20:59:17,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-20 20:59:17,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286048586] [2023-12-20 20:59:17,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 20:59:17,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 20:59:17,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:59:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 20:59:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-20 20:59:17,522 INFO L87 Difference]: Start difference. First operand 375 states and 580 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2023-12-20 20:59:17,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:59:17,869 INFO L93 Difference]: Finished difference Result 739 states and 1131 transitions. [2023-12-20 20:59:17,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 20:59:17,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 215 [2023-12-20 20:59:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:59:17,875 INFO L225 Difference]: With dead ends: 739 [2023-12-20 20:59:17,875 INFO L226 Difference]: Without dead ends: 381 [2023-12-20 20:59:17,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2023-12-20 20:59:17,877 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 169 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 20:59:17,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 412 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 20:59:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-12-20 20:59:17,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 362. [2023-12-20 20:59:17,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 241 states have (on average 1.3443983402489628) internal successors, (324), 243 states have internal predecessors, (324), 110 states have call successors, (110), 10 states have call predecessors, (110), 10 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2023-12-20 20:59:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 544 transitions. [2023-12-20 20:59:17,893 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 544 transitions. Word has length 215 [2023-12-20 20:59:17,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:59:17,893 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 544 transitions. [2023-12-20 20:59:17,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2023-12-20 20:59:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 544 transitions. [2023-12-20 20:59:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-20 20:59:17,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:59:17,895 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:59:17,908 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-20 20:59:18,100 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-20 20:59:18,100 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:59:18,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:59:18,100 INFO L85 PathProgramCache]: Analyzing trace with hash 803881560, now seen corresponding path program 1 times [2023-12-20 20:59:18,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:59:18,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122292883] [2023-12-20 20:59:18,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:59:18,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:59:18,117 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:59:18,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1226302715] [2023-12-20 20:59:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:59:18,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:59:18,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:59:18,119 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-20 20:59:18,161 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-20 20:59:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:59:18,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-20 20:59:18,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:59:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:59:24,483 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 20:59:24,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:59:24,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122292883] [2023-12-20 20:59:24,483 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:59:24,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226302715] [2023-12-20 20:59:24,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226302715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 20:59:24,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 20:59:24,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-20 20:59:24,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516982226] [2023-12-20 20:59:24,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:59:24,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 20:59:24,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:59:24,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 20:59:24,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-20 20:59:24,485 INFO L87 Difference]: Start difference. First operand 362 states and 544 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:59:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:59:25,290 INFO L93 Difference]: Finished difference Result 830 states and 1234 transitions. [2023-12-20 20:59:25,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-20 20:59:25,290 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2023-12-20 20:59:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:59:25,292 INFO L225 Difference]: With dead ends: 830 [2023-12-20 20:59:25,292 INFO L226 Difference]: Without dead ends: 485 [2023-12-20 20:59:25,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2023-12-20 20:59:25,294 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 271 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 20:59:25,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 856 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 20:59:25,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2023-12-20 20:59:25,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 369. [2023-12-20 20:59:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 248 states have (on average 1.3387096774193548) internal successors, (332), 250 states have internal predecessors, (332), 110 states have call successors, (110), 10 states have call predecessors, (110), 10 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2023-12-20 20:59:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 552 transitions. [2023-12-20 20:59:25,313 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 552 transitions. Word has length 215 [2023-12-20 20:59:25,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:59:25,314 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 552 transitions. [2023-12-20 20:59:25,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:59:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 552 transitions. [2023-12-20 20:59:25,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-20 20:59:25,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:59:25,316 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:59:25,337 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-20 20:59:25,521 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-20 20:59:25,521 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:59:25,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:59:25,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1504946138, now seen corresponding path program 1 times [2023-12-20 20:59:25,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:59:25,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106428596] [2023-12-20 20:59:25,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:59:25,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:59:25,551 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:59:25,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339153745] [2023-12-20 20:59:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:59:25,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:59:25,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:59:25,565 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-20 20:59:25,567 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-20 20:59:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:59:25,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-20 20:59:25,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:59:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 849 proven. 75 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2023-12-20 20:59:26,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 20:59:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:59:40,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:59:40,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106428596] [2023-12-20 20:59:40,448 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:59:40,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339153745] [2023-12-20 20:59:40,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339153745] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 20:59:40,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 20:59:40,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2023-12-20 20:59:40,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088876077] [2023-12-20 20:59:40,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:59:40,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 20:59:40,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:59:40,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 20:59:40,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-12-20 20:59:40,453 INFO L87 Difference]: Start difference. First operand 369 states and 552 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:59:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:59:41,915 INFO L93 Difference]: Finished difference Result 826 states and 1223 transitions. [2023-12-20 20:59:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-20 20:59:41,915 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2023-12-20 20:59:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:59:41,917 INFO L225 Difference]: With dead ends: 826 [2023-12-20 20:59:41,917 INFO L226 Difference]: Without dead ends: 471 [2023-12-20 20:59:41,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2023-12-20 20:59:41,919 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 311 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 20:59:41,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1012 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 20:59:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2023-12-20 20:59:41,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 386. [2023-12-20 20:59:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 265 states have internal predecessors, (353), 112 states have call successors, (112), 11 states have call predecessors, (112), 11 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2023-12-20 20:59:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 577 transitions. [2023-12-20 20:59:41,941 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 577 transitions. Word has length 215 [2023-12-20 20:59:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:59:41,944 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 577 transitions. [2023-12-20 20:59:41,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:59:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 577 transitions. [2023-12-20 20:59:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-20 20:59:41,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:59:41,945 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:59:41,950 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-20 20:59:42,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:59:42,150 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:59:42,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:59:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1853689498, now seen corresponding path program 1 times [2023-12-20 20:59:42,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:59:42,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371696644] [2023-12-20 20:59:42,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:59:42,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:59:42,169 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:59:42,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1467239280] [2023-12-20 20:59:42,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:59:42,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:59:42,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:59:42,171 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 20:59:42,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-20 20:59:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:59:42,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-20 20:59:42,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:59:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1143 proven. 54 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2023-12-20 20:59:45,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 21:00:07,546 WARN L293 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 21:00:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 21:00:59,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:00:59,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371696644] [2023-12-20 21:00:59,532 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 21:00:59,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467239280] [2023-12-20 21:00:59,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467239280] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 21:00:59,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 21:00:59,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 29 [2023-12-20 21:00:59,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230211918] [2023-12-20 21:00:59,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:00:59,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 21:00:59,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:00:59,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 21:00:59,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=619, Unknown=4, NotChecked=0, Total=812 [2023-12-20 21:00:59,535 INFO L87 Difference]: Start difference. First operand 386 states and 577 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 21:01:12,100 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse112 (mod c_~var_1_8~0 256))) (let ((.cse109 (* 65535 c_~var_1_5~0)) (.cse110 (* 65535 c_~var_1_7~0)) (.cse106 (= 0 .cse112)) (.cse111 (= (mod c_~var_1_9~0 256) 0)) (.cse59 (mod c_~var_1_5~0 65536)) (.cse1 (mod c_~var_1_7~0 65536)) (.cse13 (mod c_~var_1_1~0 65536)) (.cse60 (mod c_~var_1_4~0 65536))) (let ((.cse44 (and (or (not .cse111) (and (<= .cse59 .cse1) (<= .cse13 .cse60))) (= 1 .cse112))) (.cse45 (and .cse106 (or (< .cse1 .cse59) (< .cse60 .cse13)) .cse111)) (.cse9 (< 56892 .cse60)) (.cse61 (= .cse13 (mod (+ .cse109 c_~var_1_4~0 .cse110) 65536))) (.cse5 (mod (+ .cse109 c_~var_1_4~0) 65536)) (.cse33 (mod c_~var_1_14~0 65536)) (.cse108 (+ .cse59 c_~var_1_11~0)) (.cse107 (mod c_~var_1_16~0 65536)) (.cse43 (+ .cse59 1)) (.cse32 (= (mod c_~last_1_var_1_8~0 256) 0))) (let ((.cse36 (not .cse32)) (.cse41 (< .cse1 .cse43)) (.cse42 (< 65534 .cse1)) (.cse37 (< .cse59 .cse1)) (.cse38 (< 65534 .cse59)) (.cse40 (= .cse13 .cse59)) (.cse35 (or (= .cse5 .cse33) .cse106 (< .cse108 (+ .cse107 1)))) (.cse8 (or .cse9 .cse61)) (.cse20 (mod (+ .cse109 56892) 65536)) (.cse4 (+ .cse13 65536)) (.cse6 (= .cse13 (mod (+ .cse109 .cse110 56892) 65536))) (.cse7 (< .cse60 56893)) (.cse11 (+ .cse1 1)) (.cse46 (or .cse44 .cse45)) (.cse83 (or .cse106 (< .cse107 .cse108) (= .cse33 (mod (+ c_~var_1_4~0 (* c_~var_1_16~0 65535) c_~var_1_11~0) 65536))))) (let ((.cse2 (mod c_~var_1_17~0 4294967296)) (.cse34 (let ((.cse84 (mod c_~var_1_11~0 4294967296))) (and (or .cse36 (and (or .cse41 .cse42 .cse40 (< .cse84 .cse11)) (or .cse37 (< .cse84 .cse43) .cse38 .cse40))) .cse35 (or .cse32 (and (or (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse85 (+ .cse5 v_z_338)) (.cse86 (+ (* 65536 v_y_338) (* v_z_338 65535)))) (or (= .cse13 .cse85) (< v_z_338 0) (< .cse86 0) (< .cse1 .cse86) (< 65535 .cse85) (< .cse84 .cse86)))) .cse6 .cse7) (or .cse9 (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse87 (+ (* 65536 v_y_338) (* v_z_338 65535)))) (or (< v_z_338 0) (< 65535 v_z_338) (< 65535 .cse87) (< .cse84 .cse87) (< .cse87 .cse11))))) .cse8 (or .cse6 .cse7 (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse89 (+ (* 65536 v_y_338) (* v_z_338 65535))) (.cse88 (+ .cse5 v_z_338))) (or (= .cse13 .cse88) (< v_z_338 0) (< .cse89 0) (< 65535 v_z_338) (< .cse1 .cse89) (< .cse84 .cse89) (= .cse88 .cse4))))) (or .cse7 (and (forall ((v_z_337 Int)) (let ((.cse91 (+ .cse20 v_z_337))) (or (forall ((v_y_337 Int)) (let ((.cse90 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< .cse84 .cse90) (< .cse90 .cse11) (< 65535 .cse90)))) (< v_z_337 0) (< 65535 .cse91) (= .cse13 .cse91)))) (forall ((v_z_337 Int)) (let ((.cse93 (+ .cse20 v_z_337))) (or (forall ((v_y_337 Int)) (let ((.cse92 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< .cse84 .cse92) (< .cse92 .cse11) (< 65535 .cse92)))) (= .cse4 .cse93) (< v_z_337 0) (< 65535 v_z_337) (= .cse13 .cse93)))) (or .cse6 (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse95 (+ .cse20 v_z_337)) (.cse94 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< .cse84 .cse94) (= .cse4 .cse95) (< .cse94 0) (< 65535 v_z_337) (< .cse95 65536) (< 65535 .cse94))))) (forall ((v_z_337 Int)) (let ((.cse97 (+ .cse20 v_z_337))) (or (forall ((v_y_337 Int)) (let ((.cse96 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< .cse84 .cse96) (< .cse96 .cse11) (< 65535 .cse96)))) (= .cse4 .cse97) (< 65535 v_z_337) (< .cse97 65536)))) (or .cse6 (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse99 (+ .cse20 v_z_337)) (.cse98 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< .cse84 .cse98) (< v_z_337 0) (< .cse98 0) (< 65535 .cse99) (= .cse13 .cse99) (< 65535 .cse98))))) (or .cse6 (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse101 (+ .cse20 v_z_337)) (.cse100 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< .cse84 .cse100) (= .cse4 .cse101) (< v_z_337 0) (< .cse100 0) (< 65535 v_z_337) (= .cse13 .cse101) (< 65535 .cse100))))))) (or (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse102 (+ (* 65536 v_y_338) (* v_z_338 65535))) (.cse103 (+ .cse5 v_z_338))) (or (< .cse102 0) (< 65535 v_z_338) (< .cse1 .cse102) (< .cse84 .cse102) (= .cse103 .cse4) (< .cse103 65536)))) .cse6 .cse7) (or .cse9 (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse104 (+ (* 65536 v_y_338) (* v_z_338 65535)))) (or (< 65535 v_z_338) (< 65535 .cse104) (< .cse84 .cse104) (< .cse104 .cse11) (< (+ .cse5 v_z_338) 65536))))) (or (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse105 (+ (* 65536 v_y_338) (* v_z_338 65535)))) (or (< v_z_338 0) (< 65535 (+ .cse5 v_z_338)) (< 65535 .cse105) (< .cse84 .cse105) (< .cse105 .cse11)))) .cse9))) .cse46 .cse83))) (.cse39 (< c_~var_1_13~0 0))) (and (or (and (or (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse0 (+ (* 65536 v_y_338) (* v_z_338 65535))) (.cse3 (+ .cse5 v_z_338))) (or (< .cse0 0) (< 65535 v_z_338) (< .cse1 .cse0) (< .cse2 .cse0) (= .cse3 .cse4) (< .cse3 65536)))) .cse6 .cse7) .cse8 (or .cse9 (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse10 (+ (* 65536 v_y_338) (* v_z_338 65535)))) (or (< v_z_338 0) (< 65535 v_z_338) (< .cse2 .cse10) (< 65535 .cse10) (< .cse10 .cse11))))) (or (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse12 (+ (* 65536 v_y_338) (* v_z_338 65535)))) (or (< v_z_338 0) (< .cse2 .cse12) (< 65535 (+ .cse5 v_z_338)) (< 65535 .cse12) (< .cse12 .cse11)))) .cse9) (or .cse6 (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse15 (+ (* 65536 v_y_338) (* v_z_338 65535))) (.cse14 (+ .cse5 v_z_338))) (or (= .cse13 .cse14) (< v_z_338 0) (< .cse15 0) (< .cse1 .cse15) (< .cse2 .cse15) (< 65535 .cse14)))) .cse7) (or (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse17 (+ (* 65536 v_y_338) (* v_z_338 65535))) (.cse16 (+ .cse5 v_z_338))) (or (= .cse13 .cse16) (< v_z_338 0) (< .cse17 0) (< 65535 v_z_338) (< .cse1 .cse17) (< .cse2 .cse17) (= .cse16 .cse4)))) .cse6 .cse7) (or (and (forall ((v_z_337 Int)) (let ((.cse18 (+ .cse20 v_z_337))) (or (= .cse4 .cse18) (forall ((v_y_337 Int)) (let ((.cse19 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< .cse19 .cse11) (< .cse2 .cse19) (< 65535 .cse19)))) (< 65535 v_z_337) (< .cse18 65536)))) (or .cse6 (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse21 (+ .cse20 v_z_337)) (.cse22 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (= .cse4 .cse21) (< .cse22 0) (< 65535 v_z_337) (< .cse2 .cse22) (< .cse21 65536) (< 65535 .cse22))))) (or .cse6 (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse24 (+ .cse20 v_z_337)) (.cse23 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< v_z_337 0) (< .cse23 0) (< 65535 .cse24) (< .cse2 .cse23) (= .cse13 .cse24) (< 65535 .cse23))))) (forall ((v_z_337 Int)) (let ((.cse25 (+ .cse20 v_z_337))) (or (= .cse4 .cse25) (< v_z_337 0) (forall ((v_y_337 Int)) (let ((.cse26 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< .cse26 .cse11) (< .cse2 .cse26) (< 65535 .cse26)))) (< 65535 v_z_337) (= .cse13 .cse25)))) (forall ((v_z_337 Int)) (let ((.cse28 (+ .cse20 v_z_337))) (or (< v_z_337 0) (forall ((v_y_337 Int)) (let ((.cse27 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< .cse27 .cse11) (< .cse2 .cse27) (< 65535 .cse27)))) (< 65535 .cse28) (= .cse13 .cse28)))) (or (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse29 (+ .cse20 v_z_337)) (.cse30 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (= .cse4 .cse29) (< v_z_337 0) (< .cse30 0) (< 65535 v_z_337) (< .cse2 .cse30) (= .cse13 .cse29) (< 65535 .cse30)))) .cse6)) .cse7) (or (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse31 (+ (* 65536 v_y_338) (* v_z_338 65535)))) (or (< 65535 v_z_338) (< .cse2 .cse31) (< 65535 .cse31) (< .cse31 .cse11) (< (+ .cse5 v_z_338) 65536)))) .cse9)) .cse32) (or (< c_~var_1_13~0 .cse33) .cse34) .cse35 (or .cse36 (and (or .cse37 .cse38 .cse39 .cse40) (or .cse41 .cse42 .cse39 .cse40))) (or (< |c_ULTIMATE.start_step_~stepLocal_4~0#1| .cse33) .cse34) (or .cse38 .cse39 .cse40) (or .cse36 (and (or .cse37 .cse38 (< .cse2 .cse43) .cse40) (or .cse41 (< .cse2 .cse11) .cse42 .cse40))) (or .cse44 .cse45 .cse39) (or (< |c_ULTIMATE.start_step_#t~ite11#1| .cse33) .cse34) (or .cse32 .cse39) .cse46 (or .cse32 (let ((.cse48 (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse82 (+ (* 65536 v_y_338) (* v_z_338 65535))) (.cse81 (+ .cse5 v_z_338))) (or (= .cse13 .cse81) (< v_z_338 0) (< .cse82 0) (< .cse1 .cse82) (< 65535 .cse81))))) (.cse58 (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse80 (+ (* 65536 v_y_338) (* v_z_338 65535)))) (or (< v_z_338 0) (< 65535 (+ .cse5 v_z_338)) (< 65535 .cse80) (< .cse80 .cse11))))) (.cse55 (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse79 (+ (* 65536 v_y_338) (* v_z_338 65535)))) (or (< 65535 v_z_338) (< 65535 .cse79) (< .cse79 .cse11) (< (+ .cse5 v_z_338) 65536))))) (.cse56 (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse78 (+ (* 65536 v_y_338) (* v_z_338 65535))) (.cse77 (+ .cse5 v_z_338))) (or (= .cse13 .cse77) (< v_z_338 0) (< .cse78 0) (< 65535 v_z_338) (< .cse1 .cse78) (= .cse77 .cse4))))) (.cse47 (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse75 (+ (* 65536 v_y_338) (* v_z_338 65535))) (.cse76 (+ .cse5 v_z_338))) (or (< .cse75 0) (< 65535 v_z_338) (< .cse1 .cse75) (= .cse76 .cse4) (< .cse76 65536))))) (.cse57 (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse74 (+ (* 65536 v_y_338) (* v_z_338 65535)))) (or (< v_z_338 0) (< 65535 v_z_338) (< 65535 .cse74) (< .cse74 .cse11))))) (.cse51 (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse72 (+ .cse20 v_z_337)) (.cse73 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (= .cse4 .cse72) (< v_z_337 0) (< .cse73 0) (< 65535 v_z_337) (= .cse13 .cse72) (< 65535 .cse73))))) (.cse53 (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse71 (+ .cse20 v_z_337)) (.cse70 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< v_z_337 0) (< .cse70 0) (< 65535 .cse71) (= .cse13 .cse71) (< 65535 .cse70))))) (.cse50 (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse68 (+ .cse20 v_z_337)) (.cse69 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (= .cse4 .cse68) (< .cse69 0) (< 65535 v_z_337) (< .cse68 65536) (< 65535 .cse69))))) (.cse52 (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse66 (+ .cse20 v_z_337)) (.cse67 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (= .cse4 .cse66) (< 65535 v_z_337) (< .cse67 .cse11) (< .cse66 65536) (< 65535 .cse67))))) (.cse49 (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse64 (+ .cse20 v_z_337)) (.cse65 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< v_z_337 0) (< 65535 .cse64) (< .cse65 .cse11) (= .cse13 .cse64) (< 65535 .cse65))))) (.cse54 (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse62 (+ .cse20 v_z_337)) (.cse63 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (= .cse4 .cse62) (< v_z_337 0) (< 65535 v_z_337) (< .cse63 .cse11) (= .cse13 .cse62) (< 65535 .cse63)))))) (and (or (and (or .cse6 .cse47 .cse7) (or .cse6 .cse48 .cse7) (or (and .cse49 (or .cse50 .cse6) (or .cse6 .cse51) .cse52 (or .cse53 .cse6) .cse54) .cse7) (or .cse9 .cse55) (or .cse6 .cse56 .cse7) (or .cse57 .cse9) (or .cse58 .cse9)) (< (+ (* 65536 (div (+ (* (- 1) .cse59) .cse60) 65536)) c_~var_1_13~0 .cse59) .cse60)) (or .cse6 .cse48 .cse7 .cse39) (or .cse58 .cse9 .cse39) (or .cse9 .cse55 .cse39) (or .cse6 .cse56 .cse7 .cse39) (or .cse6 .cse47 .cse7 .cse39) (or .cse9 .cse61 .cse39) (or .cse57 .cse9 .cse39) (or (and (or .cse6 .cse51 .cse39) (or .cse53 .cse6 .cse39) (or .cse50 .cse6 .cse39) (or .cse52 .cse39) (or .cse49 .cse39) (or .cse39 .cse54)) .cse7)))) .cse83)))))) is different from false [2023-12-20 21:01:16,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:01:18,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:01:22,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:01:26,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:01:30,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:01:34,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:01:38,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:01:42,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:01:46,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:01:50,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:01:54,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:01:58,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:02:02,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:02:06,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:02:10,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:02:14,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:02:18,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:02:43,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:03:13,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:03:17,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:03:21,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:03:46,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:03:50,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:03:54,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:04:30,566 WARN L293 SmtUtils]: Spent 15.96s on a formula simplification. DAG size of input: 279 DAG size of output: 261 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 21:04:34,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:04:38,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:04:42,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:04:46,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:04:50,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:04:52,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:04:56,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:05:49,226 WARN L293 SmtUtils]: Spent 13.01s on a formula simplification. DAG size of input: 348 DAG size of output: 328 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 21:05:53,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:05:57,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:05:58,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:06:01,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:06:06,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:06:07,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:06:34,633 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 210 DAG size of output: 197 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 21:06:38,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:06:40,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:06:44,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:06:48,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:06:53,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:06:57,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:07:21,190 WARN L293 SmtUtils]: Spent 8.98s on a formula simplification. DAG size of input: 279 DAG size of output: 264 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 21:07:25,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:07:28,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:07:33,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:07:38,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:07:42,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:07:44,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:07:49,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:07:54,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:07:56,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:08:00,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:08:05,229 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse39 (mod c_~var_1_5~0 65536)) (.cse43 (mod c_~var_1_8~0 256)) (.cse1 (mod c_~var_1_7~0 65536)) (.cse10 (* 65535 c_~var_1_5~0))) (let ((.cse5 (mod (+ .cse10 c_~var_1_4~0) 65536)) (.cse34 (= (mod c_~last_1_var_1_8~0 256) 0)) (.cse2 (mod c_~var_1_17~0 4294967296)) (.cse13 (+ .cse1 1)) (.cse33 (mod c_~var_1_4~0 65536)) (.cse9 (mod c_~var_1_1~0 65536)) (.cse36 (= 0 .cse43)) (.cse38 (mod c_~var_1_16~0 65536)) (.cse37 (+ .cse39 c_~var_1_11~0)) (.cse35 (mod c_~var_1_14~0 65536))) (and (or (let ((.cse11 (* 65535 c_~var_1_7~0))) (let ((.cse4 (+ .cse9 65536)) (.cse6 (= .cse9 (mod (+ .cse10 .cse11 56892) 65536))) (.cse7 (< .cse33 56893)) (.cse8 (< 56892 .cse33))) (and (or (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse0 (+ (* 65536 v_y_338) (* v_z_338 65535))) (.cse3 (+ .cse5 v_z_338))) (or (< .cse0 0) (< 65535 v_z_338) (< .cse1 .cse0) (< .cse2 .cse0) (= .cse3 .cse4) (< .cse3 65536)))) .cse6 .cse7) (or .cse8 (= .cse9 (mod (+ .cse10 c_~var_1_4~0 .cse11) 65536))) (or .cse8 (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse12 (+ (* 65536 v_y_338) (* v_z_338 65535)))) (or (< v_z_338 0) (< 65535 v_z_338) (< .cse2 .cse12) (< 65535 .cse12) (< .cse12 .cse13))))) (or (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse14 (+ (* 65536 v_y_338) (* v_z_338 65535)))) (or (< v_z_338 0) (< .cse2 .cse14) (< 65535 (+ .cse5 v_z_338)) (< 65535 .cse14) (< .cse14 .cse13)))) .cse8) (or .cse6 (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse16 (+ (* 65536 v_y_338) (* v_z_338 65535))) (.cse15 (+ .cse5 v_z_338))) (or (= .cse9 .cse15) (< v_z_338 0) (< .cse16 0) (< .cse1 .cse16) (< .cse2 .cse16) (< 65535 .cse15)))) .cse7) (or (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse18 (+ (* 65536 v_y_338) (* v_z_338 65535))) (.cse17 (+ .cse5 v_z_338))) (or (= .cse9 .cse17) (< v_z_338 0) (< .cse18 0) (< 65535 v_z_338) (< .cse1 .cse18) (< .cse2 .cse18) (= .cse17 .cse4)))) .cse6 .cse7) (or (let ((.cse21 (mod (+ .cse10 56892) 65536))) (and (forall ((v_z_337 Int)) (let ((.cse19 (+ .cse21 v_z_337))) (or (= .cse4 .cse19) (forall ((v_y_337 Int)) (let ((.cse20 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< .cse20 .cse13) (< .cse2 .cse20) (< 65535 .cse20)))) (< 65535 v_z_337) (< .cse19 65536)))) (or .cse6 (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse22 (+ .cse21 v_z_337)) (.cse23 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (= .cse4 .cse22) (< .cse23 0) (< 65535 v_z_337) (< .cse2 .cse23) (< .cse22 65536) (< 65535 .cse23))))) (or .cse6 (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse25 (+ .cse21 v_z_337)) (.cse24 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< v_z_337 0) (< .cse24 0) (< 65535 .cse25) (< .cse2 .cse24) (= .cse9 .cse25) (< 65535 .cse24))))) (forall ((v_z_337 Int)) (let ((.cse26 (+ .cse21 v_z_337))) (or (= .cse4 .cse26) (< v_z_337 0) (forall ((v_y_337 Int)) (let ((.cse27 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< .cse27 .cse13) (< .cse2 .cse27) (< 65535 .cse27)))) (< 65535 v_z_337) (= .cse9 .cse26)))) (forall ((v_z_337 Int)) (let ((.cse29 (+ .cse21 v_z_337))) (or (< v_z_337 0) (forall ((v_y_337 Int)) (let ((.cse28 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (< .cse28 .cse13) (< .cse2 .cse28) (< 65535 .cse28)))) (< 65535 .cse29) (= .cse9 .cse29)))) (or (forall ((v_y_337 Int) (v_z_337 Int)) (let ((.cse30 (+ .cse21 v_z_337)) (.cse31 (+ (* v_z_337 65535) (* 65536 v_y_337)))) (or (= .cse4 .cse30) (< v_z_337 0) (< .cse31 0) (< 65535 v_z_337) (< .cse2 .cse31) (= .cse9 .cse30) (< 65535 .cse31)))) .cse6))) .cse7) (or (forall ((v_y_338 Int) (v_z_338 Int)) (let ((.cse32 (+ (* 65536 v_y_338) (* v_z_338 65535)))) (or (< 65535 v_z_338) (< .cse2 .cse32) (< 65535 .cse32) (< .cse32 .cse13) (< (+ .cse5 v_z_338) 65536)))) .cse8)))) .cse34) (or (= .cse5 .cse35) .cse36 (< .cse37 (+ .cse38 1))) (or (not .cse34) (let ((.cse40 (+ .cse39 1)) (.cse41 (= .cse9 .cse39))) (and (or (< .cse39 .cse1) (< 65534 .cse39) (< .cse2 .cse40) .cse41) (or (< .cse1 .cse40) (< .cse2 .cse13) (< 65534 .cse1) .cse41)))) |c_ULTIMATE.start_property_#t~short35#1| (let ((.cse42 (= (mod c_~var_1_9~0 256) 0))) (or (and (or (not .cse42) (and (<= .cse39 .cse1) (<= .cse9 .cse33))) (= 1 .cse43)) (and .cse36 (or (< .cse1 .cse39) (< .cse33 .cse9)) .cse42))) (or .cse36 (< .cse38 .cse37) (= .cse35 (mod (+ c_~var_1_4~0 (* c_~var_1_16~0 65535) c_~var_1_11~0) 65536)))))) is different from false [2023-12-20 21:08:09,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:08:13,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:08:39,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:08:43,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:08:47,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:08:51,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:09:19,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:09:20,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:09:24,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:09:28,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:00,733 WARN L293 SmtUtils]: Spent 7.52s on a formula simplification. DAG size of input: 278 DAG size of output: 263 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 21:10:04,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:08,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:11,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:15,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:19,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:24,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:28,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:30,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:34,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:39,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:43,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:48,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:52,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:56,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:10:59,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:11:01,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:11:04,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:11:05,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 21:11:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:11:09,487 INFO L93 Difference]: Finished difference Result 951 states and 1399 transitions. [2023-12-20 21:11:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-20 21:11:09,487 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2023-12-20 21:11:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:11:09,489 INFO L225 Difference]: With dead ends: 951 [2023-12-20 21:11:09,489 INFO L226 Difference]: Without dead ends: 702 [2023-12-20 21:11:09,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 330.5s TimeCoverageRelationStatistics Valid=373, Invalid=1753, Unknown=44, NotChecked=182, Total=2352 [2023-12-20 21:11:09,491 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 509 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 11 mSolverCounterUnsat, 64 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 306.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 64 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 309.3s IncrementalHoareTripleChecker+Time [2023-12-20 21:11:09,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1436 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1107 Invalid, 64 Unknown, 38 Unchecked, 309.3s Time] [2023-12-20 21:11:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2023-12-20 21:11:09,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 411. [2023-12-20 21:11:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 287 states have (on average 1.362369337979094) internal successors, (391), 290 states have internal predecessors, (391), 112 states have call successors, (112), 11 states have call predecessors, (112), 11 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2023-12-20 21:11:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 615 transitions. [2023-12-20 21:11:09,528 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 615 transitions. Word has length 215 [2023-12-20 21:11:09,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:11:09,528 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 615 transitions. [2023-12-20 21:11:09,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 21:11:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 615 transitions. [2023-12-20 21:11:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-20 21:11:09,530 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:11:09,530 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 21:11:09,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-20 21:11:09,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-20 21:11:09,736 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:11:09,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:11:09,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1740213220, now seen corresponding path program 1 times [2023-12-20 21:11:09,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:11:09,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981335444] [2023-12-20 21:11:09,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:11:09,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:11:09,757 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 21:11:09,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [617163622] [2023-12-20 21:11:09,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:11:09,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 21:11:09,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:11:09,762 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 21:11:09,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-20 21:11:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:11:09,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-20 21:11:09,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 21:11:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1213 proven. 456 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2023-12-20 21:11:15,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-20 21:11:56,197 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-20 21:11:56,197 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 21:11:57,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-20 21:11:57,397 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-20 21:11:57,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-20 21:11:57,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 21:11:57,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 21:11:57,513 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 216 with TraceHistMax 34,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-20 21:11:57,516 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 21:11:57,518 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 21:11:57,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 09:11:57 BoogieIcfgContainer [2023-12-20 21:11:57,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 21:11:57,520 INFO L158 Benchmark]: Toolchain (without parser) took 872342.63ms. Allocated memory was 323.0MB in the beginning and 1.0GB in the end (delta: 710.9MB). Free memory was 271.9MB in the beginning and 962.4MB in the end (delta: -690.5MB). Peak memory consumption was 624.9MB. Max. memory is 8.0GB. [2023-12-20 21:11:57,520 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory was 138.0MB in the beginning and 137.9MB in the end (delta: 124.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 21:11:57,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.13ms. Allocated memory is still 323.0MB. Free memory was 271.9MB in the beginning and 255.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-20 21:11:57,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.37ms. Allocated memory is still 323.0MB. Free memory was 255.1MB in the beginning and 250.4MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-20 21:11:57,520 INFO L158 Benchmark]: Boogie Preprocessor took 64.61ms. Allocated memory is still 323.0MB. Free memory was 249.9MB in the beginning and 242.6MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-20 21:11:57,520 INFO L158 Benchmark]: RCFGBuilder took 553.89ms. Allocated memory is still 323.0MB. Free memory was 242.0MB in the beginning and 210.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-12-20 21:11:57,521 INFO L158 Benchmark]: TraceAbstraction took 871356.43ms. Allocated memory was 323.0MB in the beginning and 1.0GB in the end (delta: 710.9MB). Free memory was 210.1MB in the beginning and 962.4MB in the end (delta: -752.4MB). Peak memory consumption was 563.1MB. Max. memory is 8.0GB. [2023-12-20 21:11:57,521 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.10ms. Allocated memory is still 185.6MB. Free memory was 138.0MB in the beginning and 137.9MB in the end (delta: 124.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 297.13ms. Allocated memory is still 323.0MB. Free memory was 271.9MB in the beginning and 255.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.37ms. Allocated memory is still 323.0MB. Free memory was 255.1MB in the beginning and 250.4MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.61ms. Allocated memory is still 323.0MB. Free memory was 249.9MB in the beginning and 242.6MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 553.89ms. Allocated memory is still 323.0MB. Free memory was 242.0MB in the beginning and 210.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 871356.43ms. Allocated memory was 323.0MB in the beginning and 1.0GB in the end (delta: 710.9MB). Free memory was 210.1MB in the beginning and 962.4MB in the end (delta: -752.4MB). Peak memory consumption was 563.1MB. 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 216 with TraceHistMax 34,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 871.3s, OverallIterations: 11, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 672.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 64 mSolverCounterUnknown, 2888 SdHoareTripleChecker+Valid, 314.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2871 mSDsluCounter, 6995 SdHoareTripleChecker+Invalid, 310.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 38 IncrementalHoareTripleChecker+Unchecked, 5536 mSDsCounter, 407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4306 IncrementalHoareTripleChecker+Invalid, 4815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 407 mSolverCounterUnsat, 1459 mSDtfsCounter, 4306 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3340 GetRequests, 3079 SyntacticMatches, 2 SemanticMatches, 259 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4581 ImplicationChecksByTransitivity, 394.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=411occurred in iteration=10, InterpolantAutomatonStates: 187, 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, 10 MinimizatonAttempts, 987 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 146.4s InterpolantComputationTime, 2362 NumberOfCodeBlocks, 2362 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3208 ConstructedInterpolants, 14 QuantifiedInterpolants, 44895 SizeOfPredicates, 112 NumberOfNonLiveVariables, 4857 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 32742/33660 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