/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/gcd_1+newton_2_2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-18 22:37:45,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-18 22:37:45,834 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-18 22:37:45,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-18 22:37:45,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-18 22:37:45,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-18 22:37:45,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-18 22:37:45,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-18 22:37:45,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-18 22:37:45,859 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-18 22:37:45,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-18 22:37:45,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-18 22:37:45,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-18 22:37:45,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-18 22:37:45,867 INFO L153 SettingsManager]: * Use SBE=true [2023-12-18 22:37:45,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-18 22:37:45,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-18 22:37:45,869 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-18 22:37:45,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-18 22:37:45,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-18 22:37:45,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-18 22:37:45,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-18 22:37:45,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-18 22:37:45,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-18 22:37:45,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-18 22:37:45,871 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-18 22:37:45,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-18 22:37:45,872 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-18 22:37:45,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-18 22:37:45,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-18 22:37:45,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-18 22:37:45,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-18 22:37:45,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 22:37:45,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-18 22:37:45,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-18 22:37:45,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-18 22:37:45,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-18 22:37:45,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-18 22:37:45,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-18 22:37:45,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-18 22:37:45,875 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-18 22:37:45,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-18 22:37:45,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-18 22:37:45,876 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-18 22:37:46,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-18 22:37:46,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-18 22:37:46,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-18 22:37:46,127 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-18 22:37:46,127 INFO L274 PluginConnector]: CDTParser initialized [2023-12-18 22:37:46,128 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-18 22:37:47,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-18 22:37:47,434 INFO L384 CDTParser]: Found 1 translation units. [2023-12-18 22:37:47,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/gcd_1+newton_2_2.i [2023-12-18 22:37:47,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976eb9a61/5e90c67759c9499c8a7e8a32174df85e/FLAG402a45d3a [2023-12-18 22:37:47,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976eb9a61/5e90c67759c9499c8a7e8a32174df85e [2023-12-18 22:37:47,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-18 22:37:47,456 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-18 22:37:47,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-18 22:37:47,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-18 22:37:47,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-18 22:37:47,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:37:47" (1/1) ... [2023-12-18 22:37:47,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259d67ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47, skipping insertion in model container [2023-12-18 22:37:47,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:37:47" (1/1) ... [2023-12-18 22:37:47,485 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-18 22:37:47,609 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-18 22:37:47,629 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-18 22:37:47,631 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 22:37:47,644 INFO L202 MainTranslator]: Completed pre-run [2023-12-18 22:37:47,656 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-18 22:37:47,665 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-18 22:37:47,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 22:37:47,679 INFO L206 MainTranslator]: Completed translation [2023-12-18 22:37:47,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47 WrapperNode [2023-12-18 22:37:47,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-18 22:37:47,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-18 22:37:47,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-18 22:37:47,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-18 22:37:47,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47" (1/1) ... [2023-12-18 22:37:47,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47" (1/1) ... [2023-12-18 22:37:47,719 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2023-12-18 22:37:47,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-18 22:37:47,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-18 22:37:47,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-18 22:37:47,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-18 22:37:47,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47" (1/1) ... [2023-12-18 22:37:47,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47" (1/1) ... [2023-12-18 22:37:47,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47" (1/1) ... [2023-12-18 22:37:47,749 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-18 22:37:47,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47" (1/1) ... [2023-12-18 22:37:47,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47" (1/1) ... [2023-12-18 22:37:47,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47" (1/1) ... [2023-12-18 22:37:47,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47" (1/1) ... [2023-12-18 22:37:47,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47" (1/1) ... [2023-12-18 22:37:47,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47" (1/1) ... [2023-12-18 22:37:47,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-18 22:37:47,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-18 22:37:47,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-18 22:37:47,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-18 22:37:47,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47" (1/1) ... [2023-12-18 22:37:47,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 22:37:47,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:37:47,801 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-18 22:37:47,824 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-18 22:37:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-18 22:37:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-18 22:37:47,842 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-18 22:37:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-18 22:37:47,844 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-18 22:37:47,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-18 22:37:47,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-18 22:37:47,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-18 22:37:47,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-18 22:37:47,922 INFO L241 CfgBuilder]: Building ICFG [2023-12-18 22:37:47,924 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-18 22:37:48,084 INFO L282 CfgBuilder]: Performing block encoding [2023-12-18 22:37:48,114 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-18 22:37:48,114 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-18 22:37:48,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:37:48 BoogieIcfgContainer [2023-12-18 22:37:48,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-18 22:37:48,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-18 22:37:48,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-18 22:37:48,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-18 22:37:48,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:37:47" (1/3) ... [2023-12-18 22:37:48,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d22deca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:37:48, skipping insertion in model container [2023-12-18 22:37:48,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:37:47" (2/3) ... [2023-12-18 22:37:48,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d22deca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:37:48, skipping insertion in model container [2023-12-18 22:37:48,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:37:48" (3/3) ... [2023-12-18 22:37:48,126 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_2_2.i [2023-12-18 22:37:48,138 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-18 22:37:48,138 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-18 22:37:48,175 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-18 22:37:48,180 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;@449f4996, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-18 22:37:48,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-18 22:37:48,183 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-18 22:37:48,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-18 22:37:48,188 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:37:48,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:37:48,189 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:37:48,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:37:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash -115348373, now seen corresponding path program 1 times [2023-12-18 22:37:48,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:37:48,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107496199] [2023-12-18 22:37:48,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:37:48,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:37:48,267 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-18 22:37:48,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016198692] [2023-12-18 22:37:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:37:48,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:37:48,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:37:48,272 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-18 22:37:48,279 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-18 22:37:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:37:48,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-18 22:37:48,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:37:48,369 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-18 22:37:48,369 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:37:48,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:37:48,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107496199] [2023-12-18 22:37:48,370 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-18 22:37:48,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016198692] [2023-12-18 22:37:48,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016198692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:37:48,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:37:48,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-18 22:37:48,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648812475] [2023-12-18 22:37:48,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:37:48,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-18 22:37:48,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:37:48,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-18 22:37:48,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-18 22:37:48,423 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-18 22:37:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:37:48,467 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2023-12-18 22:37:48,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-18 22:37:48,470 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-18 22:37:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:37:48,475 INFO L225 Difference]: With dead ends: 53 [2023-12-18 22:37:48,476 INFO L226 Difference]: Without dead ends: 25 [2023-12-18 22:37:48,479 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-18 22:37:48,484 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-18 22:37:48,485 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-18 22:37:48,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-18 22:37:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-18 22:37:48,525 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-18 22:37:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-12-18 22:37:48,528 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2023-12-18 22:37:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:37:48,529 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-12-18 22:37:48,530 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-18 22:37:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-12-18 22:37:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-18 22:37:48,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:37:48,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:37:48,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-18 22:37:48,737 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-18 22:37:48,738 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:37:48,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:37:48,739 INFO L85 PathProgramCache]: Analyzing trace with hash -115467537, now seen corresponding path program 1 times [2023-12-18 22:37:48,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:37:48,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825454989] [2023-12-18 22:37:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:37:48,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:37:48,752 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-18 22:37:48,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [961673312] [2023-12-18 22:37:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:37:48,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:37:48,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:37:48,755 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-18 22:37:48,771 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-18 22:37:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:37:48,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-18 22:37:48,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:37:48,854 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-18 22:37:48,854 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:37:48,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:37:48,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825454989] [2023-12-18 22:37:48,855 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-18 22:37:48,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961673312] [2023-12-18 22:37:48,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961673312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:37:48,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:37:48,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-18 22:37:48,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295468639] [2023-12-18 22:37:48,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:37:48,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:37:48,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:37:48,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:37:48,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-18 22:37:48,858 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-18 22:37:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:37:48,875 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-12-18 22:37:48,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:37:48,875 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-18 22:37:48,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:37:48,876 INFO L225 Difference]: With dead ends: 31 [2023-12-18 22:37:48,876 INFO L226 Difference]: Without dead ends: 26 [2023-12-18 22:37:48,877 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-18 22:37:48,878 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-18 22:37:48,878 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-18 22:37:48,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-18 22:37:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-18 22:37:48,883 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-18 22:37:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-18 22:37:48,883 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2023-12-18 22:37:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:37:48,884 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-18 22:37:48,884 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-18 22:37:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-18 22:37:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-18 22:37:48,885 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:37:48,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:37:48,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-18 22:37:49,097 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-18 22:37:49,097 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:37:49,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:37:49,098 INFO L85 PathProgramCache]: Analyzing trace with hash 772550301, now seen corresponding path program 1 times [2023-12-18 22:37:49,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:37:49,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991741590] [2023-12-18 22:37:49,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:37:49,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:37:49,110 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-18 22:37:49,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585108926] [2023-12-18 22:37:49,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:37:49,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:37:49,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:37:49,114 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-18 22:37:49,125 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-18 22:37:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:37:49,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-18 22:37:49,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:37:49,221 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-18 22:37:49,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 22:37:49,249 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-18 22:37:49,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:37:49,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991741590] [2023-12-18 22:37:49,250 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-18 22:37:49,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585108926] [2023-12-18 22:37:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585108926] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 22:37:49,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-18 22:37:49,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-12-18 22:37:49,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275694070] [2023-12-18 22:37:49,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-18 22:37:49,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-18 22:37:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:37:49,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-18 22:37:49,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:37:49,252 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-18 22:37:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:37:49,315 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-12-18 22:37:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-18 22:37:49,316 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-18 22:37:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:37:49,317 INFO L225 Difference]: With dead ends: 31 [2023-12-18 22:37:49,317 INFO L226 Difference]: Without dead ends: 27 [2023-12-18 22:37:49,317 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-18 22:37:49,319 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-18 22:37:49,319 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-18 22:37:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-18 22:37:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-18 22:37:49,323 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-18 22:37:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-12-18 22:37:49,324 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2023-12-18 22:37:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:37:49,324 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-12-18 22:37:49,324 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-18 22:37:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-12-18 22:37:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-18 22:37:49,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:37:49,326 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:37:49,335 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-18 22:37:49,530 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-18 22:37:49,531 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:37:49,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:37:49,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1820926095, now seen corresponding path program 2 times [2023-12-18 22:37:49,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:37:49,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24310111] [2023-12-18 22:37:49,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:37:49,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:37:49,543 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-18 22:37:49,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2115997094] [2023-12-18 22:37:49,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-18 22:37:49,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:37:49,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:37:49,545 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-18 22:37:49,564 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-18 22:37:51,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-18 22:37:51,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-18 22:37:51,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-18 22:37:51,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:38:15,082 WARN L293 SmtUtils]: Spent 6.75s 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-18 22:38:27,114 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-18 22:38:43,890 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-18 22:38:43,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 22:40:45,296 WARN L293 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-18 22:40:52,129 WARN L293 SmtUtils]: Spent 6.83s 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-18 22:41:35,849 WARN L854 $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 false [2023-12-18 22:42:16,087 WARN L293 SmtUtils]: Spent 12.38s 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-18 22:42:51,901 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-18 22:43:00,906 WARN L293 SmtUtils]: Spent 8.02s 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-18 22:43:50,714 WARN L293 SmtUtils]: Spent 29.13s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 22:44:02,740 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-18 22:44:08,492 WARN L293 SmtUtils]: Spent 5.75s 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-18 22:44:42,103 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-18 22:44:49,509 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-18 22:44:49,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:44:49,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24310111] [2023-12-18 22:44:49,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-18 22:44:49,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115997094] [2023-12-18 22:44:49,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115997094] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 22:44:49,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-18 22:44:49,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2023-12-18 22:44:49,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383470687] [2023-12-18 22:44:49,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-18 22:44:49,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-18 22:44:49,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:44:49,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-18 22:44:49,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=99, Unknown=8, NotChecked=20, Total=156 [2023-12-18 22:44:49,512 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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-18 22:45:26,544 WARN L293 SmtUtils]: Spent 31.70s on a formula simplification. DAG size of input: 46 DAG size of output: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 22:45:30,622 WARN L854 $PredicateComparison]: unable to prove that (and (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)) (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (= (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= |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 (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (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 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) 256) 0)) (= .cse5 0) (< .cse3 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 false [2023-12-18 22:46:24,123 WARN L293 SmtUtils]: Spent 33.60s on a formula simplification. DAG size of input: 101 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 22:46:26,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-18 22:46:30,946 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-18 22:46:32,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-18 22:46:36,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-18 22:46:40,526 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse31 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse40 (mod (+ .cse31 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse39 (mod .cse31 256)) (.cse34 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse42 (= .cse40 0)) (.cse43 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse40) 256) 0))) (.cse15 (< 0 .cse38))) (let ((.cse26 (or .cse42 .cse43 .cse15)) (.cse11 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse39)) 256) 0)) .cse34)) (.cse41 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse40)) 256) 0))) (.cse21 (= .cse31 0))) (let ((.cse17 (< 127 .cse39)) (.cse25 (or .cse21 .cse42 .cse43 .cse15)) (.cse24 (or .cse21 .cse41 .cse15)) (.cse28 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse39) 256) 0))) (.cse29 (= .cse39 0)) (.cse0 (< .cse40 128)) (.cse7 (and .cse11 (or .cse41 .cse15))) (.cse8 (< 127 .cse40)) (.cse10 (and .cse11 .cse26)) (.cse16 (< .cse39 128)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse32 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse27 (<= .cse38 0))) (and (or (let ((.cse30 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse20 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0))) (.cse22 (= .cse30 0))) (let ((.cse5 (< .cse30 128)) (.cse12 (or .cse20 .cse22 .cse15)) (.cse1 (< 127 .cse30)) (.cse13 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse30)) 256) 0)))) (and (or (let ((.cse4 (or .cse13 (and (or .cse14 .cse15) .cse11))) (.cse3 (or (and .cse11 .cse12) .cse13))) (and (or .cse0 (let ((.cse2 (or .cse6 .cse7))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse8 (let ((.cse9 (or .cse10 .cse6))) (and (or .cse5 (and .cse9 .cse4)) (or (and .cse9 .cse3) .cse1)))))) .cse16) (or .cse17 (let ((.cse19 (or (and .cse27 (not .cse21)) .cse28 .cse29))) (let ((.cse23 (or .cse13 (and .cse19 (or .cse21 .cse14 .cse15))))) (and (or (let ((.cse18 (or (and .cse19 .cse24) .cse6))) (and (or .cse1 (and .cse18 (or .cse13 (and .cse19 (or .cse20 .cse21 .cse22 .cse15))))) (or (and .cse18 .cse23) .cse5))) .cse0) (or .cse8 (and (or (and (or (and .cse25 .cse19) .cse6) .cse23) .cse5) (or (and (or .cse6 (and .cse19 .cse26)) (or (and .cse12 .cse19) .cse13)) .cse1))))))))))) .cse32) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (or (and (or .cse17 (let ((.cse33 (or .cse34 .cse28 .cse29))) (and (or .cse8 (and .cse33 .cse25)) (or .cse0 (and .cse33 .cse24))))) (or (and (or .cse0 .cse7) (or .cse8 .cse10)) .cse16)) .cse6 .cse32) (let ((.cse36 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (exists ((v_y_1 Int)) (let ((.cse35 (* 256 v_y_1))) (and (<= 0 (+ .cse35 .cse36 128)) (<= (+ .cse35 .cse36 1) 0) (= (mod (+ .cse35 .cse36) |c_ULTIMATE.start_gcd_test_~b#1|) 0))))) (and (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (exists ((v_y_3 Int)) (let ((.cse37 (* 256 v_y_3))) (and (<= (+ 65281 .cse36 .cse37) 0) (= (mod (+ 65280 .cse36 .cse37) |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 65408 .cse36 .cse37))))) .cse27))) (<= 1 |c_ULTIMATE.start_gcd_test_~b#1|))))))) is different from false [2023-12-18 22:46:56,453 WARN L293 SmtUtils]: Spent 6.84s on a formula simplification. DAG size of input: 58 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-18 22:47:02,388 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-18 22:47:07,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-18 22:47:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:47:07,161 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2023-12-18 22:47:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-18 22:47:07,161 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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-18 22:47:07,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:47:07,162 INFO L225 Difference]: With dead ends: 35 [2023-12-18 22:47:07,162 INFO L226 Difference]: Without dead ends: 27 [2023-12-18 22:47:07,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 222.2s TimeCoverageRelationStatistics Valid=50, Invalid=159, Unknown=17, NotChecked=116, Total=342 [2023-12-18 22:47:07,164 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2023-12-18 22:47:07,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 166 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 1 Unknown, 51 Unchecked, 19.5s Time] [2023-12-18 22:47:07,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-18 22:47:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-18 22:47:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 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-18 22:47:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-12-18 22:47:07,169 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 11 [2023-12-18 22:47:07,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:47:07,169 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-12-18 22:47:07,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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-18 22:47:07,169 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-12-18 22:47:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-18 22:47:07,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:47:07,170 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-18 22:47:07,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-18 22:47:07,372 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-18 22:47:07,372 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:47:07,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:47:07,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1664694575, now seen corresponding path program 1 times [2023-12-18 22:47:07,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:47:07,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218291929] [2023-12-18 22:47:07,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:47:07,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:47:07,379 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-18 22:47:07,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077747413] [2023-12-18 22:47:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:47:07,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:47:07,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:47:07,381 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-18 22:47:07,383 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-18 22:47:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:47:07,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-18 22:47:07,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:47:08,051 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-18 22:47:08,051 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-18 22:47:27,685 WARN L293 SmtUtils]: Spent 7.65s 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-18 22:47:34,288 WARN L293 SmtUtils]: Spent 5.17s 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-18 22:48:05,641 WARN L293 SmtUtils]: Spent 5.08s 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-18 22:50:22,535 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod (+ .cse26 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse27 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse24 (= .cse27 0)) (.cse25 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse27) 256) 0))))) (.cse19 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse28) 256) 0))))) (.cse21 (= .cse28 0)) (.cse11 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)))) (let ((.cse0 (< 127 .cse28)) (.cse8 (or .cse19 .cse21 .cse11)) (.cse13 (or .cse24 .cse11 .cse25)) (.cse3 (< .cse27 128)) (.cse5 (< 127 .cse27)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ (- 256) .cse28)) 256) 0))))) (.cse12 (< .cse28 128)) (.cse15 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (or (not (= 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ (- 256) .cse27)) 256))) (< |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse14 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse17 (mod .cse26 256))) (and (or (let ((.cse7 (or .cse16 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ (- 256) .cse17)) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~b#1|)))))) (let ((.cse2 (or (and .cse7 (or .cse15 .cse11)) .cse14)) (.cse4 (or (and .cse7 .cse13) .cse14))) (and (or .cse0 (let ((.cse1 (or .cse6 (and .cse7 .cse8)))) (and (or (and .cse1 .cse2) .cse3) (or (and .cse4 .cse1) .cse5)))) (or (let ((.cse9 (or (and .cse7 (or .cse10 .cse11)) .cse6))) (and (or (and .cse9 .cse2) .cse3) (or .cse5 (and .cse9 .cse4)))) .cse12)))) (< .cse17 128)) (or (< 127 .cse17) (let ((.cse20 (= .cse26 0)) (.cse22 (or .cse16 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse17) 256) 0)))) (= .cse17 0)))) (let ((.cse18 (or (and (or .cse20 .cse15 .cse11) .cse22) .cse14))) (and (or .cse0 (and (or (and .cse18 (or (and (or .cse19 .cse20 .cse21 .cse11) .cse22) .cse6)) .cse3) (or (and (or (and .cse22 .cse8) .cse6) (or .cse14 (and .cse22 .cse13))) .cse5))) (or (let ((.cse23 (or .cse6 (and .cse22 (or .cse20 .cse10 .cse11))))) (and (or (and .cse23 .cse18) .cse3) (or .cse5 (and .cse23 (or .cse14 (and .cse22 (or .cse20 .cse24 .cse11 .cse25))))))) .cse12)))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from false [2023-12-18 22:50:36,780 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-18 22:50:36,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:50:36,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218291929] [2023-12-18 22:50:36,780 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-18 22:50:36,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077747413] [2023-12-18 22:50:36,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077747413] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-18 22:50:36,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-18 22:50:36,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2023-12-18 22:50:36,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320639989] [2023-12-18 22:50:36,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-18 22:50:36,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-18 22:50:36,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:50:36,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-18 22:50:36,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2023-12-18 22:50:36,782 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-18 22:50:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:50:37,672 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2023-12-18 22:50:37,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-18 22:50:37,673 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-18 22:50:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:50:37,673 INFO L225 Difference]: With dead ends: 27 [2023-12-18 22:50:37,673 INFO L226 Difference]: Without dead ends: 17 [2023-12-18 22:50:37,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2023-12-18 22:50:37,674 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-18 22:50:37,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 5 Unchecked, 0.3s Time] [2023-12-18 22:50:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-18 22:50:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-18 22:50:37,677 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-18 22:50:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-12-18 22:50:37,677 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2023-12-18 22:50:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:50:37,677 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-12-18 22:50:37,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-18 22:50:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-12-18 22:50:37,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-18 22:50:37,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:50:37,678 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-18 22:50:37,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-18 22:50:37,880 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-18 22:50:37,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:50:37,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:50:37,881 INFO L85 PathProgramCache]: Analyzing trace with hash -148224385, now seen corresponding path program 1 times [2023-12-18 22:50:37,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:50:37,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468029839] [2023-12-18 22:50:37,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:50:37,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:50:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-18 22:50:37,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-18 22:50:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-18 22:50:37,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-18 22:50:37,936 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-18 22:50:37,937 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-18 22:50:37,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-18 22:50:37,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-18 22:50:37,943 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2023-12-18 22:50:37,947 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-18 22:50:37,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:50:37 BoogieIcfgContainer [2023-12-18 22:50:37,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-18 22:50:37,970 INFO L158 Benchmark]: Toolchain (without parser) took 770514.36ms. Allocated memory was 271.6MB in the beginning and 336.6MB in the end (delta: 65.0MB). Free memory was 225.0MB in the beginning and 134.8MB in the end (delta: 90.2MB). Peak memory consumption was 155.8MB. Max. memory is 8.0GB. [2023-12-18 22:50:37,970 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 191.9MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-18 22:50:37,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.14ms. Allocated memory is still 271.6MB. Free memory was 224.5MB in the beginning and 213.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-18 22:50:37,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.70ms. Allocated memory is still 271.6MB. Free memory was 212.4MB in the beginning and 210.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-18 22:50:37,971 INFO L158 Benchmark]: Boogie Preprocessor took 41.50ms. Allocated memory is still 271.6MB. Free memory was 210.9MB in the beginning and 208.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-18 22:50:37,972 INFO L158 Benchmark]: RCFGBuilder took 352.63ms. Allocated memory is still 271.6MB. Free memory was 208.8MB in the beginning and 194.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-18 22:50:37,972 INFO L158 Benchmark]: TraceAbstraction took 769848.58ms. Allocated memory was 271.6MB in the beginning and 336.6MB in the end (delta: 65.0MB). Free memory was 194.1MB in the beginning and 134.8MB in the end (delta: 59.3MB). Peak memory consumption was 125.4MB. Max. memory is 8.0GB. [2023-12-18 22:50:37,974 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 191.9MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.14ms. Allocated memory is still 271.6MB. Free memory was 224.5MB in the beginning and 213.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.70ms. Allocated memory is still 271.6MB. Free memory was 212.4MB in the beginning and 210.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.50ms. Allocated memory is still 271.6MB. Free memory was 210.9MB in the beginning and 208.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 352.63ms. Allocated memory is still 271.6MB. Free memory was 208.8MB in the beginning and 194.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 769848.58ms. Allocated memory was 271.6MB in the beginning and 336.6MB in the end (delta: 65.0MB). Free memory was 194.1MB in the beginning and 134.8MB in the end (delta: 59.3MB). Peak memory consumption was 125.4MB. 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: 769.8s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 138.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 19.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 19.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 56 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 126 IncrementalHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 110 mSDtfsCounter, 126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 231.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 23, 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, 627.0s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 74 ConstructedInterpolants, 7 QuantifiedInterpolants, 5174 SizeOfPredicates, 21 NumberOfNonLiveVariables, 406 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 4/14 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-18 22:50:38,204 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-18 22:50:38,328 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...