/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_1+newton_2_2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 11:47:04,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 11:47:04,944 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 11:47:04,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 11:47:04,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 11:47:04,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 11:47:04,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 11:47:04,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 11:47:04,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 11:47:04,986 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 11:47:04,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 11:47:04,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 11:47:04,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 11:47:04,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 11:47:04,988 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 11:47:04,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 11:47:04,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 11:47:04,989 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 11:47:04,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 11:47:04,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 11:47:04,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 11:47:04,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 11:47:04,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 11:47:04,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 11:47:04,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 11:47:04,991 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 11:47:04,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 11:47:04,991 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 11:47:04,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 11:47:04,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 11:47:04,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 11:47:04,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 11:47:04,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 11:47:04,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 11:47:04,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 11:47:04,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 11:47:04,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 11:47:04,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 11:47:04,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 11:47:04,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 11:47:04,994 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 11:47:04,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 11:47:04,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 11:47:04,994 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 11:47:05,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 11:47:05,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 11:47:05,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 11:47:05,230 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 11:47:05,231 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 11:47:05,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/gcd_1+newton_2_2.i [2023-12-20 11:47:06,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 11:47:06,514 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 11:47:06,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_1+newton_2_2.i [2023-12-20 11:47:06,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52ceebdeb/2fcdab47dd20491eb54333f05eb88445/FLAGd0d83680c [2023-12-20 11:47:06,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52ceebdeb/2fcdab47dd20491eb54333f05eb88445 [2023-12-20 11:47:06,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 11:47:06,538 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 11:47:06,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 11:47:06,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 11:47:06,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 11:47:06,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:47:06" (1/1) ... [2023-12-20 11:47:06,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464b2cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06, skipping insertion in model container [2023-12-20 11:47:06,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:47:06" (1/1) ... [2023-12-20 11:47:06,563 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 11:47:06,684 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_1+newton_2_2.i[1226,1239] [2023-12-20 11:47:06,722 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_1+newton_2_2.i[2807,2820] [2023-12-20 11:47:06,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 11:47:06,732 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 11:47:06,743 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_1+newton_2_2.i[1226,1239] [2023-12-20 11:47:06,758 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_1+newton_2_2.i[2807,2820] [2023-12-20 11:47:06,759 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 11:47:06,772 INFO L206 MainTranslator]: Completed translation [2023-12-20 11:47:06,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06 WrapperNode [2023-12-20 11:47:06,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 11:47:06,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 11:47:06,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 11:47:06,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 11:47:06,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06" (1/1) ... [2023-12-20 11:47:06,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06" (1/1) ... [2023-12-20 11:47:06,799 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2023-12-20 11:47:06,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 11:47:06,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 11:47:06,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 11:47:06,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 11:47:06,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06" (1/1) ... [2023-12-20 11:47:06,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06" (1/1) ... [2023-12-20 11:47:06,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06" (1/1) ... [2023-12-20 11:47:06,838 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 11:47:06,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06" (1/1) ... [2023-12-20 11:47:06,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06" (1/1) ... [2023-12-20 11:47:06,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06" (1/1) ... [2023-12-20 11:47:06,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06" (1/1) ... [2023-12-20 11:47:06,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06" (1/1) ... [2023-12-20 11:47:06,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06" (1/1) ... [2023-12-20 11:47:06,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 11:47:06,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 11:47:06,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 11:47:06,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 11:47:06,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06" (1/1) ... [2023-12-20 11:47:06,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 11:47:06,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:47:06,881 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 11:47:06,912 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 11:47:06,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 11:47:06,920 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-20 11:47:06,920 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-20 11:47:06,921 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-20 11:47:06,921 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-20 11:47:06,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 11:47:06,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-20 11:47:06,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 11:47:06,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 11:47:06,982 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 11:47:06,985 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 11:47:07,138 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 11:47:07,161 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 11:47:07,161 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 11:47:07,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:47:07 BoogieIcfgContainer [2023-12-20 11:47:07,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 11:47:07,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 11:47:07,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 11:47:07,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 11:47:07,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 11:47:06" (1/3) ... [2023-12-20 11:47:07,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63befe22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:47:07, skipping insertion in model container [2023-12-20 11:47:07,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:47:06" (2/3) ... [2023-12-20 11:47:07,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63befe22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:47:07, skipping insertion in model container [2023-12-20 11:47:07,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:47:07" (3/3) ... [2023-12-20 11:47:07,167 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_2_2.i [2023-12-20 11:47:07,179 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 11:47:07,179 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-20 11:47:07,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 11:47:07,212 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;@2c08e618, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 11:47:07,213 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-20 11:47:07,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-20 11:47:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-20 11:47:07,224 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:47:07,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:47:07,225 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:47:07,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:47:07,228 INFO L85 PathProgramCache]: Analyzing trace with hash -115348373, now seen corresponding path program 1 times [2023-12-20 11:47:07,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:47:07,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999281374] [2023-12-20 11:47:07,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:47:07,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:47:07,293 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 11:47:07,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094133565] [2023-12-20 11:47:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:47:07,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:47:07,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:47:07,296 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 11:47:07,302 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 11:47:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:47:07,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-20 11:47:07,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:47:07,365 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 11:47:07,365 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:47:07,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:47:07,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999281374] [2023-12-20 11:47:07,366 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 11:47:07,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094133565] [2023-12-20 11:47:07,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094133565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:47:07,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:47:07,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 11:47:07,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87638419] [2023-12-20 11:47:07,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:47:07,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 11:47:07,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:47:07,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 11:47:07,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 11:47:07,394 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 11:47:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:47:07,416 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2023-12-20 11:47:07,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 11:47:07,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 11:47:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:47:07,422 INFO L225 Difference]: With dead ends: 53 [2023-12-20 11:47:07,422 INFO L226 Difference]: Without dead ends: 25 [2023-12-20 11:47:07,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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 11:47:07,427 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:47:07,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:47:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-20 11:47:07,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-20 11:47:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-20 11:47:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-12-20 11:47:07,454 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2023-12-20 11:47:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:47:07,454 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-12-20 11:47:07,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 11:47:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-12-20 11:47:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-20 11:47:07,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:47:07,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:47:07,463 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 11:47:07,660 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 11:47:07,661 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:47:07,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:47:07,662 INFO L85 PathProgramCache]: Analyzing trace with hash -115467537, now seen corresponding path program 1 times [2023-12-20 11:47:07,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:47:07,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111609958] [2023-12-20 11:47:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:47:07,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:47:07,671 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 11:47:07,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2079415858] [2023-12-20 11:47:07,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:47:07,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:47:07,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:47:07,675 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 11:47:07,694 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 11:47:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:47:07,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-20 11:47:07,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:47:07,781 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 11:47:07,781 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:47:07,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:47:07,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111609958] [2023-12-20 11:47:07,782 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 11:47:07,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079415858] [2023-12-20 11:47:07,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079415858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:47:07,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:47:07,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 11:47:07,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684931373] [2023-12-20 11:47:07,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:47:07,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:47:07,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:47:07,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:47:07,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 11:47:07,784 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 11:47:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:47:07,797 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-12-20 11:47:07,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:47:07,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 11:47:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:47:07,798 INFO L225 Difference]: With dead ends: 31 [2023-12-20 11:47:07,798 INFO L226 Difference]: Without dead ends: 26 [2023-12-20 11:47:07,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 11:47:07,799 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:47:07,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 40 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:47:07,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-20 11:47:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-20 11:47:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-20 11:47:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-20 11:47:07,803 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2023-12-20 11:47:07,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:47:07,803 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-20 11:47:07,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 11:47:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-20 11:47:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-20 11:47:07,804 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:47:07,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:47:07,824 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 11:47:08,009 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 11:47:08,010 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:47:08,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:47:08,010 INFO L85 PathProgramCache]: Analyzing trace with hash 772550301, now seen corresponding path program 1 times [2023-12-20 11:47:08,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:47:08,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847234622] [2023-12-20 11:47:08,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:47:08,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:47:08,031 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 11:47:08,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1607931934] [2023-12-20 11:47:08,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:47:08,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:47:08,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:47:08,046 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 11:47:08,054 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 11:47:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:47:08,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-20 11:47:08,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:47:08,133 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 11:47:08,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 11:47:08,159 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 11:47:08,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:47:08,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847234622] [2023-12-20 11:47:08,159 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 11:47:08,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607931934] [2023-12-20 11:47:08,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607931934] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 11:47:08,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 11:47:08,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-12-20 11:47:08,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732675650] [2023-12-20 11:47:08,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 11:47:08,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 11:47:08,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:47:08,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 11:47:08,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:47:08,162 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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 11:47:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:47:08,203 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-12-20 11:47:08,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 11:47:08,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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 11:47:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:47:08,205 INFO L225 Difference]: With dead ends: 31 [2023-12-20 11:47:08,205 INFO L226 Difference]: Without dead ends: 27 [2023-12-20 11:47:08,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:47:08,209 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:47:08,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 99 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:47:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-20 11:47:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-20 11:47:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-20 11:47:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-12-20 11:47:08,222 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2023-12-20 11:47:08,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:47:08,224 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-12-20 11:47:08,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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 11:47:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-12-20 11:47:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-20 11:47:08,224 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:47:08,225 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:47:08,230 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 11:47:08,425 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 11:47:08,426 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:47:08,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:47:08,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1820926095, now seen corresponding path program 2 times [2023-12-20 11:47:08,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:47:08,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495143628] [2023-12-20 11:47:08,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:47:08,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:47:08,438 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 11:47:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730443830] [2023-12-20 11:47:08,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-20 11:47:08,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:47:08,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:47:08,443 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 11:47:08,445 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 11:47:10,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-20 11:47:10,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 11:47:10,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-20 11:47:10,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:47:44,585 WARN L293 SmtUtils]: Spent 8.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 11:48:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:48:14,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 11:48:48,928 WARN L293 SmtUtils]: Spent 6.60s 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 11:49:35,904 WARN L293 SmtUtils]: Spent 7.49s 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 11:49:47,937 WARN L293 SmtUtils]: Spent 6.44s 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 11:50:06,673 WARN L293 SmtUtils]: Spent 5.89s 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 11:50:11,894 WARN L293 SmtUtils]: Spent 5.22s 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 11:50:29,822 WARN L293 SmtUtils]: Spent 8.01s 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 11:51:50,405 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse28 (mod (+ .cse26 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse27 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0))) (.cse21 (= .cse27 0)) (.cse23 (= .cse28 0)) (.cse24 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse9 (< 0 .cse25))) (let ((.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0))) (.cse0 (< .cse28 128)) (.cse10 (< 127 .cse28)) (.cse5 (< .cse27 128)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse12 (or .cse23 .cse24 .cse9)) (.cse13 (or .cse19 .cse21 .cse9)) (.cse1 (< 127 .cse27)) (.cse14 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse15 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse27)) 256) 0))) (.cse16 (mod .cse26 256))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse16)) 256) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0)))) (let ((.cse4 (or .cse14 (and (or .cse15 .cse9) .cse7))) (.cse3 (or (and .cse7 .cse13) .cse14))) (and (or .cse0 (let ((.cse2 (or .cse6 (and .cse7 (or .cse8 .cse9))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse10 (let ((.cse11 (or (and .cse7 .cse12) .cse6))) (and (or .cse5 (and .cse11 .cse4)) (or (and .cse11 .cse3) .cse1))))))) (< .cse16 128)) (or (< 127 .cse16) (let ((.cse20 (= .cse26 0))) (let ((.cse18 (or (and (<= .cse25 0) (not .cse20)) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (= .cse16 0)))) (let ((.cse22 (or .cse14 (and .cse18 (or .cse20 .cse15 .cse9))))) (and (or (let ((.cse17 (or (and .cse18 (or .cse20 .cse8 .cse9)) .cse6))) (and (or .cse1 (and .cse17 (or .cse14 (and .cse18 (or .cse19 .cse20 .cse21 .cse9))))) (or (and .cse17 .cse22) .cse5))) .cse0) (or .cse10 (and (or (and (or (and (or .cse20 .cse23 .cse24 .cse9) .cse18) .cse6) .cse22) .cse5) (or (and (or .cse6 (and .cse18 .cse12)) (or (and .cse13 .cse18) .cse14)) .cse1))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2023-12-20 11:52:49,340 WARN L293 SmtUtils]: Spent 24.50s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 11:53:33,827 WARN L293 SmtUtils]: Spent 7.61s 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 11:53:39,614 WARN L293 SmtUtils]: Spent 5.79s 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 11:53:46,163 WARN L293 SmtUtils]: Spent 6.55s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 11:53:54,704 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse0 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (and (let ((.cse1 (mod (mod .cse0 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (< 127 .cse0) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse1) 256) 0)) (= .cse1 0))) (let ((.cse2 (mod (+ .cse0 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (< .cse0 128) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse2 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) (= .cse2 0))))) (< 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (< |c_ULTIMATE.start_main1_~y~0#1| 1)) is different from true [2023-12-20 11:54:06,730 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 11:54:14,359 WARN L293 SmtUtils]: Spent 7.63s 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 11:54:47,390 WARN L293 SmtUtils]: Spent 8.01s 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 11:55:08,025 WARN L293 SmtUtils]: Spent 8.01s 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 11:55:28,220 WARN L876 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_11| Int) (v_z_7 Int) (v_y_7 Int)) (let ((.cse0 (mod (mod v_z_7 |v_ULTIMATE.start_main1_~y~0#1_11|) 256)) (.cse1 (* 255 v_z_7)) (.cse2 (* 256 v_y_7))) (or (= .cse0 0) (not (= (mod (mod |v_ULTIMATE.start_main1_~y~0#1_11| .cse0) 256) 0)) (< v_z_7 0) (< (+ .cse1 128 .cse2) 0) (< 0 (+ .cse1 .cse2 1)) (< |v_ULTIMATE.start_main1_~y~0#1_11| 1) (not (= (mod (+ .cse1 .cse2) |v_ULTIMATE.start_main1_~y~0#1_11|) 0)) (< 127 v_z_7)))) is different from true [2023-12-20 11:55:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-20 11:55:28,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:55:28,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495143628] [2023-12-20 11:55:28,221 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 11:55:28,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730443830] [2023-12-20 11:55:28,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730443830] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 11:55:28,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 11:55:28,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2023-12-20 11:55:28,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76446329] [2023-12-20 11:55:28,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 11:55:28,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 11:55:28,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:55:28,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 11:55:28,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=80, Unknown=11, NotChecked=60, Total=182 [2023-12-20 11:55:28,223 INFO L87 Difference]: Start difference. First operand 27 states and 30 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 11:55:59,183 WARN L293 SmtUtils]: Spent 24.51s on a formula simplification. DAG size of input: 46 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 11:56:28,424 WARN L293 SmtUtils]: Spent 23.44s on a formula simplification. DAG size of input: 53 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 11:56:32,464 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 [] [2023-12-20 11:57:22,602 WARN L293 SmtUtils]: Spent 32.69s on a formula simplification. DAG size of input: 107 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 11:57:26,626 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 11:57:28,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-20 11:57:56,335 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification. DAG size of input: 165 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 11:58:00,349 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 11:58:05,617 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse25 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (= .cse26 0)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse30 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (< 0 .cse25)) (.cse29 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (let ((.cse28 (mod (+ .cse26 .cse29) 256)) (.cse27 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0))) (.cse21 (= .cse27 0)) (.cse23 (= .cse28 0)) (.cse24 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0)))) (let ((.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0))) (.cse0 (< .cse28 128)) (.cse10 (< 127 .cse28)) (.cse5 (< .cse27 128)) (.cse12 (or .cse23 .cse24 .cse9)) (.cse13 (or .cse19 .cse21 .cse9)) (.cse1 (< 127 .cse27)) (.cse14 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse15 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse27)) 256) 0))) (.cse16 (mod .cse26 256))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse16)) 256) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0)))) (let ((.cse4 (or .cse14 (and (or .cse15 .cse9) .cse7))) (.cse3 (or (and .cse7 .cse13) .cse14))) (and (or .cse0 (let ((.cse2 (or .cse6 (and .cse7 (or .cse8 .cse9))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse10 (let ((.cse11 (or (and .cse7 .cse12) .cse6))) (and (or .cse5 (and .cse11 .cse4)) (or (and .cse11 .cse3) .cse1))))))) (< .cse16 128)) (or (< 127 .cse16) (let ((.cse18 (or (and (<= .cse25 0) (not .cse20)) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (= .cse16 0)))) (let ((.cse22 (or .cse14 (and .cse18 (or .cse20 .cse15 .cse9))))) (and (or (let ((.cse17 (or (and .cse18 (or .cse20 .cse8 .cse9)) .cse6))) (and (or .cse1 (and .cse17 (or .cse14 (and .cse18 (or .cse19 .cse20 .cse21 .cse9))))) (or (and .cse17 .cse22) .cse5))) .cse0) (or .cse10 (and (or (and (or (and (or .cse20 .cse23 .cse24 .cse9) .cse18) .cse6) .cse22) .cse5) (or (and (or .cse6 (and .cse18 .cse12)) (or (and .cse13 .cse18) .cse14)) .cse1))))))))))) .cse30) (<= |c_ULTIMATE.start_main1_~x~0#1| 127) .cse20 (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (or .cse6 .cse30 .cse9 (let ((.cse31 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse32 (mod (mod .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse31) (= 0 .cse32) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse32) 256) 0)))) (let ((.cse33 (mod (+ .cse31 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse33 .cse29) 256))) 256) 0)) (= .cse33 0) (< .cse31 128)))))) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= 1 |c_ULTIMATE.start_gcd_test_~b#1|)))) is different from true [2023-12-20 11:58:47,325 WARN L293 SmtUtils]: Spent 36.32s on a formula simplification. DAG size of input: 116 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 11:58:49,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 11:58:54,511 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod .cse15 256))) (let ((.cse2 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse6 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse17 (= .cse7 0)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or .cse0 .cse1 .cse2 (let ((.cse3 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse3) (= 0 .cse4) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)))) (let ((.cse5 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse5 .cse6) 256))) 256) 0)) (= .cse5 0) (< .cse3 128)))))) (or (let ((.cse19 (mod (+ .cse15 .cse6) 256))) (let ((.cse13 (< .cse19 128)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0))) (.cse8 (< 127 .cse19)) (.cse11 (= .cse19 0)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0))) (.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (and (or (< 127 .cse7) (let ((.cse9 (or .cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 0)) .cse17)) (.cse10 (= .cse15 0))) (and (or .cse8 (and .cse9 (or .cse10 .cse11 .cse12 .cse2))) (or .cse13 (and .cse9 (or .cse10 .cse14 .cse2)))))) (or (let ((.cse18 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse7)) 256) 0)) .cse16))) (and (or .cse13 (and .cse18 (or .cse14 .cse2))) (or .cse8 (and .cse18 (or .cse11 .cse12 .cse2))))) (< .cse7 128))))) .cse0 .cse1) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< (+ |c_ULTIMATE.start_gcd_test_~a#1| 128) 0)) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (not .cse17) (< (+ |c_ULTIMATE.start_gcd_test_~b#1| 128) 0) .cse1))))) is different from true [2023-12-20 11:58:59,120 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod .cse15 256))) (let ((.cse2 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse6 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse17 (= .cse7 0)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or .cse0 .cse1 .cse2 (let ((.cse3 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse3) (= 0 .cse4) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)))) (let ((.cse5 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse5 .cse6) 256))) 256) 0)) (= .cse5 0) (< .cse3 128)))))) (or (let ((.cse19 (mod (+ .cse15 .cse6) 256))) (let ((.cse13 (< .cse19 128)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0))) (.cse8 (< 127 .cse19)) (.cse11 (= .cse19 0)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0))) (.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (and (or (< 127 .cse7) (let ((.cse9 (or .cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 0)) .cse17)) (.cse10 (= .cse15 0))) (and (or .cse8 (and .cse9 (or .cse10 .cse11 .cse12 .cse2))) (or .cse13 (and .cse9 (or .cse10 .cse14 .cse2)))))) (or (let ((.cse18 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse7)) 256) 0)) .cse16))) (and (or .cse13 (and .cse18 (or .cse14 .cse2))) (or .cse8 (and .cse18 (or .cse11 .cse12 .cse2))))) (< .cse7 128))))) .cse0 .cse1) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (not .cse17) (< (+ |c_ULTIMATE.start_gcd_test_~b#1| 128) 0) .cse1))))) is different from false [2023-12-20 11:59:03,128 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod .cse15 256))) (let ((.cse2 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse6 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse17 (= .cse7 0)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or .cse0 .cse1 .cse2 (let ((.cse3 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse3) (= 0 .cse4) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)))) (let ((.cse5 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse5 .cse6) 256))) 256) 0)) (= .cse5 0) (< .cse3 128)))))) (or (let ((.cse19 (mod (+ .cse15 .cse6) 256))) (let ((.cse13 (< .cse19 128)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0))) (.cse8 (< 127 .cse19)) (.cse11 (= .cse19 0)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0))) (.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (and (or (< 127 .cse7) (let ((.cse9 (or .cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 0)) .cse17)) (.cse10 (= .cse15 0))) (and (or .cse8 (and .cse9 (or .cse10 .cse11 .cse12 .cse2))) (or .cse13 (and .cse9 (or .cse10 .cse14 .cse2)))))) (or (let ((.cse18 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse7)) 256) 0)) .cse16))) (and (or .cse13 (and .cse18 (or .cse14 .cse2))) (or .cse8 (and .cse18 (or .cse11 .cse12 .cse2))))) (< .cse7 128))))) .cse0 .cse1) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (not .cse17) (< (+ |c_ULTIMATE.start_gcd_test_~b#1| 128) 0) .cse1))))) is different from true [2023-12-20 11:59:04,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 11:59:04,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:59:04,236 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2023-12-20 11:59:04,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-20 11:59:04,237 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 11:59:04,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:59:04,238 INFO L225 Difference]: With dead ends: 37 [2023-12-20 11:59:04,238 INFO L226 Difference]: Without dead ends: 28 [2023-12-20 11:59:04,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 291.5s TimeCoverageRelationStatistics Valid=75, Invalid=169, Unknown=20, NotChecked=198, Total=462 [2023-12-20 11:59:04,238 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2023-12-20 11:59:04,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 114 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 3 Unknown, 134 Unchecked, 19.3s Time] [2023-12-20 11:59:04,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-20 11:59:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-20 11:59:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-20 11:59:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2023-12-20 11:59:04,244 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 11 [2023-12-20 11:59:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:59:04,244 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2023-12-20 11:59:04,244 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 11:59:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2023-12-20 11:59:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-20 11:59:04,245 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:59:04,245 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:59:04,251 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 11:59:04,446 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 11:59:04,447 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:59:04,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:59:04,447 INFO L85 PathProgramCache]: Analyzing trace with hash 65742623, now seen corresponding path program 1 times [2023-12-20 11:59:04,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:59:04,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376373267] [2023-12-20 11:59:04,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:59:04,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:59:04,452 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 11:59:04,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1191945796] [2023-12-20 11:59:04,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:59:04,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:59:04,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:59:04,455 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 11:59:04,457 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 11:59:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:59:04,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-20 11:59:04,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:59:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-20 11:59:04,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 11:59:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-20 11:59:10,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:59:10,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376373267] [2023-12-20 11:59:10,294 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 11:59:10,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191945796] [2023-12-20 11:59:10,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191945796] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 11:59:10,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:59:10,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-12-20 11:59:10,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597691652] [2023-12-20 11:59:10,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:59:10,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 11:59:10,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:59:10,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 11:59:10,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-12-20 11:59:10,296 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 11:59:10,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:59:10,396 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-12-20 11:59:10,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 11:59:10,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 12 [2023-12-20 11:59:10,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:59:10,396 INFO L225 Difference]: With dead ends: 28 [2023-12-20 11:59:10,396 INFO L226 Difference]: Without dead ends: 17 [2023-12-20 11:59:10,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-12-20 11:59:10,397 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 11:59:10,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 11:59:10,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-20 11:59:10,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-20 11:59:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.0) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-20 11:59:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-12-20 11:59:10,399 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2023-12-20 11:59:10,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:59:10,399 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-12-20 11:59:10,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 11:59:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-12-20 11:59:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-20 11:59:10,400 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:59:10,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:59:10,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-20 11:59:10,600 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 11:59:10,601 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:59:10,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:59:10,601 INFO L85 PathProgramCache]: Analyzing trace with hash -148224385, now seen corresponding path program 1 times [2023-12-20 11:59:10,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:59:10,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901858736] [2023-12-20 11:59:10,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:59:10,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:59:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 11:59:10,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 11:59:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 11:59:10,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 11:59:10,643 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 11:59:10,645 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-20 11:59:10,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-20 11:59:10,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 11:59:10,663 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2023-12-20 11:59:10,665 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 11:59:10,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 11:59:10 BoogieIcfgContainer [2023-12-20 11:59:10,680 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 11:59:10,680 INFO L158 Benchmark]: Toolchain (without parser) took 724142.18ms. Allocated memory was 199.2MB in the beginning and 257.9MB in the end (delta: 58.7MB). Free memory was 158.7MB in the beginning and 212.8MB in the end (delta: -54.1MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. [2023-12-20 11:59:10,680 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 199.2MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 11:59:10,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.82ms. Allocated memory is still 199.2MB. Free memory was 158.5MB in the beginning and 146.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 11:59:10,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.87ms. Allocated memory is still 199.2MB. Free memory was 146.5MB in the beginning and 144.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-20 11:59:10,681 INFO L158 Benchmark]: Boogie Preprocessor took 47.87ms. Allocated memory is still 199.2MB. Free memory was 144.8MB in the beginning and 142.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 11:59:10,681 INFO L158 Benchmark]: RCFGBuilder took 304.47ms. Allocated memory is still 199.2MB. Free memory was 142.3MB in the beginning and 128.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-20 11:59:10,681 INFO L158 Benchmark]: TraceAbstraction took 723516.56ms. Allocated memory was 199.2MB in the beginning and 257.9MB in the end (delta: 58.7MB). Free memory was 128.3MB in the beginning and 212.8MB in the end (delta: -84.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 11:59:10,682 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.49ms. Allocated memory is still 199.2MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.82ms. Allocated memory is still 199.2MB. Free memory was 158.5MB in the beginning and 146.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.87ms. Allocated memory is still 199.2MB. Free memory was 146.5MB in the beginning and 144.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.87ms. Allocated memory is still 199.2MB. Free memory was 144.8MB in the beginning and 142.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 304.47ms. Allocated memory is still 199.2MB. Free memory was 142.3MB in the beginning and 128.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 723516.56ms. Allocated memory was 199.2MB in the beginning and 257.9MB in the end (delta: 58.7MB). Free memory was 128.3MB in the beginning and 212.8MB in the end (delta: -84.5MB). There was no memory consumed. 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 - UnprovableResult [Line: 102]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryArithmeticFLOAToperation at line 95. Possible FailurePath: [L108] COND FALSE !(__VERIFIER_nondet_int()) [L111] CALL main2() [L90] float IN = __VERIFIER_nondet_float(); [L91] CALL assume_abort_if_not(IN > -0.4f && IN < 0.4f) [L75] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume_abort_if_not(IN > -0.4f && IN < 0.4f) [L93] CALL, EXPR f(IN) VAL [\old(x)=111] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L93] RET, EXPR f(IN) VAL [IN=111] [L93] CALL, EXPR fp(IN) VAL [\old(x)=111] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L93] RET, EXPR fp(IN) VAL [IN=111] [L93] float x = IN - f(IN)/fp(IN); [L95] CALL, EXPR f(x) VAL [\old(x)=112] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L95] RET, EXPR f(x) VAL [IN=111, x=112] [L95] CALL, EXPR fp(x) VAL [\old(x)=112] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L95] RET, EXPR fp(x) VAL [IN=111, x=112] [L95] x = x - f(x)/fp(x) [L101] COND TRUE !(x < 0.1) VAL [IN=111] [L102] reach_error() VAL [IN=111] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 723.5s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 216.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 19.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 331 SdHoareTripleChecker+Invalid, 19.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 134 IncrementalHoareTripleChecker+Unchecked, 223 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 138 IncrementalHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 108 mSDtfsCounter, 138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 294.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 27, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 503.3s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 76 ConstructedInterpolants, 5 QuantifiedInterpolants, 2603 SizeOfPredicates, 20 NumberOfNonLiveVariables, 413 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 13/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-20 11:59:10,887 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 11:59:10,920 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 Received shutdown request...