/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/combinations/gcd_2+newton_3_4.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 12:04:36,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 12:04:36,784 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 12:04:36,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 12:04:36,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 12:04:36,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 12:04:36,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 12:04:36,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 12:04:36,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 12:04:36,818 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 12:04:36,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 12:04:36,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 12:04:36,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 12:04:36,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 12:04:36,820 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 12:04:36,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 12:04:36,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 12:04:36,820 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 12:04:36,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 12:04:36,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 12:04:36,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 12:04:36,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 12:04:36,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 12:04:36,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 12:04:36,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 12:04:36,823 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 12:04:36,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 12:04:36,823 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 12:04:36,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 12:04:36,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 12:04:36,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 12:04:36,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 12:04:36,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 12:04:36,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 12:04:36,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 12:04:36,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 12:04:36,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 12:04:36,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 12:04:36,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 12:04:36,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 12:04:36,826 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 12:04:36,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 12:04:36,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 12:04:36,827 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 12:04:37,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 12:04:37,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 12:04:37,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 12:04:37,053 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 12:04:37,054 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 12:04:37,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/gcd_2+newton_3_4.i [2023-12-20 12:04:38,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 12:04:38,337 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 12:04:38,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_2+newton_3_4.i [2023-12-20 12:04:38,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f3f6605/d9f998ade6f044b09e00fb0ab40c3f85/FLAGc28a46d00 [2023-12-20 12:04:38,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f3f6605/d9f998ade6f044b09e00fb0ab40c3f85 [2023-12-20 12:04:38,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 12:04:38,359 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 12:04:38,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 12:04:38,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 12:04:38,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 12:04:38,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:04:38" (1/1) ... [2023-12-20 12:04:38,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139c097e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38, skipping insertion in model container [2023-12-20 12:04:38,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:04:38" (1/1) ... [2023-12-20 12:04:38,390 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 12:04:38,551 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_2+newton_3_4.i[1226,1239] [2023-12-20 12:04:38,595 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_2+newton_3_4.i[2862,2875] [2023-12-20 12:04:38,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 12:04:38,606 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 12:04:38,622 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_2+newton_3_4.i[1226,1239] [2023-12-20 12:04:38,643 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_2+newton_3_4.i[2862,2875] [2023-12-20 12:04:38,644 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 12:04:38,659 INFO L206 MainTranslator]: Completed translation [2023-12-20 12:04:38,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38 WrapperNode [2023-12-20 12:04:38,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 12:04:38,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 12:04:38,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 12:04:38,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 12:04:38,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38" (1/1) ... [2023-12-20 12:04:38,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38" (1/1) ... [2023-12-20 12:04:38,710 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 91 [2023-12-20 12:04:38,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 12:04:38,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 12:04:38,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 12:04:38,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 12:04:38,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38" (1/1) ... [2023-12-20 12:04:38,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38" (1/1) ... [2023-12-20 12:04:38,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38" (1/1) ... [2023-12-20 12:04:38,743 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-20 12:04:38,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38" (1/1) ... [2023-12-20 12:04:38,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38" (1/1) ... [2023-12-20 12:04:38,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38" (1/1) ... [2023-12-20 12:04:38,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38" (1/1) ... [2023-12-20 12:04:38,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38" (1/1) ... [2023-12-20 12:04:38,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38" (1/1) ... [2023-12-20 12:04:38,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 12:04:38,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 12:04:38,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 12:04:38,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 12:04:38,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38" (1/1) ... [2023-12-20 12:04:38,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 12:04:38,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:04:38,793 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 12:04:38,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 12:04:38,825 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-20 12:04:38,825 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-20 12:04:38,825 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-20 12:04:38,827 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-20 12:04:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 12:04:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-20 12:04:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 12:04:38,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 12:04:38,825 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 12:04:38,896 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 12:04:38,898 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 12:04:39,052 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 12:04:39,082 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 12:04:39,082 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 12:04:39,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:04:39 BoogieIcfgContainer [2023-12-20 12:04:39,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 12:04:39,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 12:04:39,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 12:04:39,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 12:04:39,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 12:04:38" (1/3) ... [2023-12-20 12:04:39,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31eb2f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:04:39, skipping insertion in model container [2023-12-20 12:04:39,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:04:38" (2/3) ... [2023-12-20 12:04:39,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31eb2f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:04:39, skipping insertion in model container [2023-12-20 12:04:39,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:04:39" (3/3) ... [2023-12-20 12:04:39,095 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_4.i [2023-12-20 12:04:39,111 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 12:04:39,112 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-20 12:04:39,181 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 12:04:39,187 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;@454fb4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 12:04:39,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-20 12:04:39,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-20 12:04:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-20 12:04:39,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:04:39,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:04:39,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:04:39,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:04:39,204 INFO L85 PathProgramCache]: Analyzing trace with hash 210916014, now seen corresponding path program 1 times [2023-12-20 12:04:39,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:04:39,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868821937] [2023-12-20 12:04:39,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:04:39,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:04:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:04:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:04:39,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:04:39,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868821937] [2023-12-20 12:04:39,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868821937] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:04:39,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:04:39,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 12:04:39,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999437509] [2023-12-20 12:04:39,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:04:39,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 12:04:39,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:04:39,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 12:04:39,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 12:04:39,497 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:04:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:04:39,610 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2023-12-20 12:04:39,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 12:04:39,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-20 12:04:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:04:39,617 INFO L225 Difference]: With dead ends: 67 [2023-12-20 12:04:39,617 INFO L226 Difference]: Without dead ends: 30 [2023-12-20 12:04:39,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:04:39,624 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 12:04:39,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 81 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 12:04:39,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-20 12:04:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-12-20 12:04:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-20 12:04:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-12-20 12:04:39,661 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 9 [2023-12-20 12:04:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:04:39,661 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-12-20 12:04:39,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:04:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-12-20 12:04:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-20 12:04:39,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:04:39,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:04:39,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 12:04:39,663 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:04:39,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:04:39,664 INFO L85 PathProgramCache]: Analyzing trace with hash 268174316, now seen corresponding path program 1 times [2023-12-20 12:04:39,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:04:39,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118943897] [2023-12-20 12:04:39,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:04:39,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:04:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:04:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:04:39,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:04:39,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118943897] [2023-12-20 12:04:39,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118943897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:04:39,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:04:39,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 12:04:39,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404560533] [2023-12-20 12:04:39,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:04:39,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 12:04:39,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:04:39,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 12:04:39,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 12:04:39,768 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:04:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:04:39,811 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2023-12-20 12:04:39,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 12:04:39,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-20 12:04:39,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:04:39,813 INFO L225 Difference]: With dead ends: 34 [2023-12-20 12:04:39,813 INFO L226 Difference]: Without dead ends: 29 [2023-12-20 12:04:39,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:04:39,814 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:04:39,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:04:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-20 12:04:39,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-20 12:04:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-20 12:04:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-12-20 12:04:39,825 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 9 [2023-12-20 12:04:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:04:39,826 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-12-20 12:04:39,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:04:39,826 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-12-20 12:04:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-20 12:04:39,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:04:39,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:04:39,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 12:04:39,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:04:39,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:04:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash -291101499, now seen corresponding path program 1 times [2023-12-20 12:04:39,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:04:39,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447025146] [2023-12-20 12:04:39,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:04:39,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:04:39,845 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 12:04:39,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1032439888] [2023-12-20 12:04:39,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:04:39,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:04:39,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:04:39,848 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 12:04:39,850 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 12:04:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:04:39,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-20 12:04:39,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:04:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:04:39,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:04:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:04:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:04:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447025146] [2023-12-20 12:04:40,058 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 12:04:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032439888] [2023-12-20 12:04:40,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032439888] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:04:40,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 12:04:40,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-12-20 12:04:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889037694] [2023-12-20 12:04:40,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 12:04:40,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 12:04:40,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:04:40,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 12:04:40,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 12:04:40,060 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:04:40,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:04:40,105 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-12-20 12:04:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 12:04:40,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-20 12:04:40,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:04:40,106 INFO L225 Difference]: With dead ends: 35 [2023-12-20 12:04:40,106 INFO L226 Difference]: Without dead ends: 30 [2023-12-20 12:04:40,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-20 12:04:40,108 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:04:40,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:04:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-20 12:04:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-20 12:04:40,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-20 12:04:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-12-20 12:04:40,112 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2023-12-20 12:04:40,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:04:40,113 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-12-20 12:04:40,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:04:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-12-20 12:04:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-20 12:04:40,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:04:40,114 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:04:40,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 12:04:40,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:04:40,319 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:04:40,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:04:40,320 INFO L85 PathProgramCache]: Analyzing trace with hash -448782580, now seen corresponding path program 2 times [2023-12-20 12:04:40,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:04:40,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464944889] [2023-12-20 12:04:40,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:04:40,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:04:40,329 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 12:04:40,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1916348034] [2023-12-20 12:04:40,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-20 12:04:40,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:04:40,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:04:40,330 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 12:04:40,354 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 12:04:40,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-20 12:04:40,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 12:04:40,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-20 12:04:40,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:05:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:05:03,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:05:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:05:47,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:05:47,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464944889] [2023-12-20 12:05:47,263 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 12:05:47,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916348034] [2023-12-20 12:05:47,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916348034] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:05:47,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 12:05:47,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-20 12:05:47,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922516665] [2023-12-20 12:05:47,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 12:05:47,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 12:05:47,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:05:47,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 12:05:47,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=137, Unknown=7, NotChecked=0, Total=182 [2023-12-20 12:05:47,266 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:06:29,698 WARN L293 SmtUtils]: Spent 26.83s on a formula simplification. DAG size of input: 312 DAG size of output: 313 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 12:06:31,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-12-20 12:06:35,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-12-20 12:06:39,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-12-20 12:06:43,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-12-20 12:07:06,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:07:10,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:07:13,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:07:30,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:07:34,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:07:38,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:07:43,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:07:48,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:08:05,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:08:09,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 12:08:13,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2023-12-20 12:08:17,560 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (let ((.cse2 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse9 (<= |c_ULTIMATE.start_main1_~g~0#1| 0))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse1 (mod (+ .cse0 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (not (= .cse0 0)) (<= 128 .cse1) (<= (mod .cse0 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ .cse0 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse2 .cse1))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse3 (mod .cse4 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse3) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse3 127) (<= (mod (+ .cse4 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= (mod (+ .cse4 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))))) (and (exists ((v_y_4 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_6 Int) (v_z_6 Int)) (let ((.cse7 (* 256 v_y_6)) (.cse8 (* 255 v_z_6))) (let ((.cse6 (+ (* 256 v_y_4) .cse7 .cse8)) (.cse5 (+ .cse7 .cse8))) (and (<= .cse5 127) (<= v_z_6 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse6) 0) (<= .cse6 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_6) (not (= .cse6 0)) (<= 0 .cse6) (<= 0 .cse5))))) .cse9) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse11 (mod (+ .cse10 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 128 (mod .cse10 256)) (<= 128 (mod (+ .cse10 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse11) (<= .cse11 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse12 (mod .cse13 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse12) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse13 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= .cse12 127) (<= (mod (+ .cse13 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse15 (mod (+ .cse14 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (not (= .cse14 0)) (<= 128 .cse15) (<= 128 (mod (+ .cse14 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod .cse14 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse2 .cse15))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse17 (mod (+ .cse16 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (not (= .cse16 0)) (<= 128 (mod (+ .cse16 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod .cse16 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse17) (<= .cse17 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse19 (mod (+ .cse18 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 128 (mod .cse18 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse19) (<= .cse19 127) (<= (mod (+ .cse18 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse20 (mod .cse21 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 128 .cse20) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse21 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (mod (+ .cse21 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= .cse2 .cse20) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse22 (mod .cse23 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 128 .cse22) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse23 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= 128 (mod (+ .cse23 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse2 .cse22) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse24 (mod .cse25 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse24) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse25 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= 128 (mod (+ .cse25 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse24 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse26 (mod .cse27 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 128 .cse26) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ .cse27 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= .cse2 .cse26) (<= (mod (+ .cse27 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse28 (mod .cse29 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse28) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse29 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= .cse28 127) (<= (mod (+ .cse29 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse31 (mod (+ .cse30 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 128 (mod .cse30 256)) (<= 128 .cse31) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ .cse30 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse2 .cse31))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse32 (mod .cse33 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 128 .cse32) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= 128 (mod (+ .cse33 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256)) (<= .cse2 .cse32) (<= (mod (+ .cse33 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse35 (mod (+ .cse34 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (not (= .cse34 0)) (<= (mod .cse34 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse35) (<= .cse35 127) (<= (mod (+ .cse34 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256) 127) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|))))) (and (exists ((v_z_3 Int) (v_y_3 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_1 Int)) (let ((.cse38 (* 255 v_z_3)) (.cse39 (* 256 v_y_3))) (let ((.cse36 (+ (* 256 v_y_1) .cse38 .cse39)) (.cse37 (+ .cse38 .cse39))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse36) 0) (<= 0 .cse37) (<= 0 .cse36) (<= .cse36 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_3) (<= v_z_3 255) (<= .cse37 127))))) .cse9) (and .cse9 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_y_7 Int) (v_z_9 Int) (v_y_9 Int)) (let ((.cse42 (* 256 v_y_9)) (.cse43 (* 255 v_z_9))) (let ((.cse40 (+ .cse42 .cse43)) (.cse41 (+ .cse42 .cse43 (* 256 v_y_7)))) (and (<= v_z_9 255) (<= 128 .cse40) (<= .cse41 |c_ULTIMATE.start_main1_~y~0#1|) (<= 128 v_z_9) (<= .cse40 255) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse41) 0) (<= 0 .cse41)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (|v_ULTIMATE.start_gcd_test_~b#1_15| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |v_ULTIMATE.start_gcd_test_~b#1_15|))) (let ((.cse45 (mod (+ .cse44 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_15|)) 256))) (and (not (= |v_ULTIMATE.start_gcd_test_~b#1_15| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_15|) (<= 128 (mod .cse44 256)) (<= 128 .cse45) (<= 128 (mod (+ .cse44 |v_ULTIMATE.start_gcd_test_~b#1_15|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_15| |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse2 .cse45))))) (and .cse9 (exists ((v_y_12 Int) (|v_ULTIMATE.start_gcd_test_~a#1_18| Int) (v_z_12 Int) (v_y_11 Int)) (let ((.cse48 (* v_y_12 256)) (.cse49 (* v_z_12 255))) (let ((.cse47 (+ .cse48 .cse49 (* v_y_11 256))) (.cse46 (+ .cse48 .cse49))) (and (<= 128 .cse46) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_18| .cse47) 0) (<= v_z_12 127) (<= .cse47 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 v_z_12) (<= 0 .cse47) (<= .cse46 255))))))))) is different from false [2023-12-20 12:08:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:08:40,150 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-12-20 12:08:40,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 12:08:40,151 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-20 12:08:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:08:40,151 INFO L225 Difference]: With dead ends: 40 [2023-12-20 12:08:40,151 INFO L226 Difference]: Without dead ends: 32 [2023-12-20 12:08:40,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 164.1s TimeCoverageRelationStatistics Valid=83, Invalid=281, Unknown=20, NotChecked=36, Total=420 [2023-12-20 12:08:40,153 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.8s IncrementalHoareTripleChecker+Time [2023-12-20 12:08:40,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 12 Unknown, 0 Unchecked, 59.8s Time] [2023-12-20 12:08:40,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-20 12:08:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-20 12:08:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-20 12:08:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-12-20 12:08:40,164 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2023-12-20 12:08:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:08:40,164 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-12-20 12:08:40,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:08:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-12-20 12:08:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-20 12:08:40,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:08:40,165 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:08:40,172 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 12:08:40,366 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,SelfDestructingSolverStorable3 [2023-12-20 12:08:40,366 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:08:40,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:08:40,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2045375020, now seen corresponding path program 3 times [2023-12-20 12:08:40,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:08:40,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962908214] [2023-12-20 12:08:40,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:08:40,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:08:40,375 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 12:08:40,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149400542] [2023-12-20 12:08:40,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-20 12:08:40,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:08:40,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:08:40,377 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 12:08:40,383 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 12:08:40,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-20 12:08:40,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 12:08:40,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-20 12:08:40,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:09:24,536 WARN L293 SmtUtils]: Spent 12.06s on a formula simplification. DAG size of input: 80 DAG size of output: 75 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 12:10:00,124 WARN L293 SmtUtils]: Spent 10.52s on a formula simplification. DAG size of input: 81 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 12:10:32,938 WARN L293 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 12:11:03,003 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 74 DAG size of output: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 12:11:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:11:08,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:13:49,797 WARN L293 SmtUtils]: Spent 1.35m on a formula simplification. DAG size of input: 90 DAG size of output: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 12:15:04,063 WARN L293 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:15:09,414 WARN L293 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:15:29,638 WARN L293 SmtUtils]: Spent 7.55s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:15:39,498 WARN L293 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:15:53,541 WARN L293 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:15:59,524 WARN L293 SmtUtils]: Spent 5.98s 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 12:16:23,901 WARN L293 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:16:37,649 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:16:50,337 WARN L293 SmtUtils]: Spent 7.71s 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 12:16:58,363 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:17:22,571 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:17:35,527 WARN L293 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:17:53,421 WARN L293 SmtUtils]: Spent 8.04s 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 12:18:29,121 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse19 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse19 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse29 (+ (- 256) .cse25))) (let ((.cse18 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse27 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse25) 256)) (.cse17 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse28 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256))) (let ((.cse13 (not (= (mod (mod .cse29 .cse28) 256) 0))) (.cse14 (< .cse28 .cse17)) (.cse7 (= .cse25 0)) (.cse8 (not (= (mod (mod .cse25 .cse27) 256) 0))) (.cse9 (< .cse27 .cse17)) (.cse10 (< 0 .cse18)) (.cse26 (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse1 (< 127 .cse25)) (.cse5 (< 127 .cse26)) (.cse2 (or .cse7 .cse8 .cse9 .cse10)) (.cse11 (< .cse26 128)) (.cse4 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse15 (or .cse13 .cse14 .cse10)) (.cse12 (< .cse25 128)) (.cse0 (mod .cse19 256))) (and (or (< 127 .cse0) (let ((.cse6 (= .cse19 0))) (let ((.cse3 (let ((.cse16 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse0) 256))) (or (not (= (mod (mod .cse0 .cse16) 256) 0)) (< .cse16 .cse17) (and (<= .cse18 0) (not .cse6)) (= .cse0 0))))) (and (or .cse1 (and (or (and .cse2 .cse3) .cse4 .cse5) (or (and (or .cse6 .cse7 .cse8 .cse9 .cse10) .cse3) .cse4 .cse11))) (or .cse12 (and (or (and (or .cse6 .cse13 .cse14 .cse10) .cse3) .cse4) (or .cse4 (and .cse15 .cse3) .cse11))))))) (or (let ((.cse21 (let ((.cse24 (+ (- 256) .cse0))) (let ((.cse23 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse24) 256))) (or (< .cse23 .cse17) (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (not (= 0 (mod (mod .cse24 .cse23) 256)))))))) (and (or .cse1 (let ((.cse20 (and .cse2 .cse21))) (and (or .cse20 .cse4 .cse11) (or .cse20 .cse4 .cse5)))) (or (let ((.cse22 (and .cse15 .cse21))) (and (or .cse4 .cse22 .cse11) (or .cse4 .cse22))) .cse12))) (< .cse0 128))))))))) (< |c_ULTIMATE.start_main1_~y~0#1| 1) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2023-12-20 12:18:36,621 WARN L293 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:18:43,271 WARN L293 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:18:48,518 WARN L293 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:18:57,372 WARN L293 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:19:02,678 WARN L293 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 12:19:15,479 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-20 12:19:17,038 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 12:19:17,038 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 12:19:18,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-20 12:19:18,239 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 12:19:18,323 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 12:19:18,325 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-20 12:19:18,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 12:19:18,326 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 14 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-20 12:19:18,333 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-20 12:19:18,335 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2023-12-20 12:19:18,338 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 12:19:18,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 12:19:18 BoogieIcfgContainer [2023-12-20 12:19:18,339 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 12:19:18,340 INFO L158 Benchmark]: Toolchain (without parser) took 879981.21ms. Allocated memory was 276.8MB in the beginning and 352.3MB in the end (delta: 75.5MB). Free memory was 218.8MB in the beginning and 164.2MB in the end (delta: 54.6MB). Peak memory consumption was 189.1MB. Max. memory is 8.0GB. [2023-12-20 12:19:18,340 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 183.5MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 12:19:18,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.04ms. Allocated memory is still 276.8MB. Free memory was 218.5MB in the beginning and 206.5MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-20 12:19:18,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.77ms. Allocated memory is still 276.8MB. Free memory was 206.5MB in the beginning and 204.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 12:19:18,341 INFO L158 Benchmark]: Boogie Preprocessor took 52.77ms. Allocated memory is still 276.8MB. Free memory was 204.5MB in the beginning and 202.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 12:19:18,341 INFO L158 Benchmark]: RCFGBuilder took 317.37ms. Allocated memory is still 276.8MB. Free memory was 202.4MB in the beginning and 188.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-20 12:19:18,342 INFO L158 Benchmark]: TraceAbstraction took 879254.73ms. Allocated memory was 276.8MB in the beginning and 352.3MB in the end (delta: 75.5MB). Free memory was 188.0MB in the beginning and 164.2MB in the end (delta: 23.8MB). Peak memory consumption was 158.7MB. Max. memory is 8.0GB. [2023-12-20 12:19:18,343 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.14ms. Allocated memory is still 183.5MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 302.04ms. Allocated memory is still 276.8MB. Free memory was 218.5MB in the beginning and 206.5MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.77ms. Allocated memory is still 276.8MB. Free memory was 206.5MB in the beginning and 204.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.77ms. Allocated memory is still 276.8MB. Free memory was 204.5MB in the beginning and 202.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 317.37ms. Allocated memory is still 276.8MB. Free memory was 202.4MB in the beginning and 188.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 879254.73ms. Allocated memory was 276.8MB in the beginning and 352.3MB in the end (delta: 75.5MB). Free memory was 188.0MB in the beginning and 164.2MB in the end (delta: 23.8MB). Peak memory consumption was 158.7MB. 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: 27]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 27). Cancelled while NwaCegarLoop was analyzing trace of length 14 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 102). Cancelled while NwaCegarLoop was analyzing trace of length 14 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 879.2s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 173.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 59.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 512 SdHoareTripleChecker+Invalid, 59.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 106 mSDtfsCounter, 192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 164.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 67.2s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 54 ConstructedInterpolants, 7 QuantifiedInterpolants, 8014 SizeOfPredicates, 13 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/8 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