./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 613ee8845912b921567ac9e82f8c414d8758c61c69ed2c2ac2cbc303a1b4f001 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:13:30,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:13:30,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:13:30,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:13:30,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:13:30,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:13:30,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:13:30,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:13:30,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:13:30,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:13:30,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:13:30,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:13:30,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:13:30,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:13:30,593 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:13:30,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:13:30,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:13:30,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:13:30,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:13:30,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:13:30,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:13:30,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:13:30,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:13:30,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:13:30,599 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:13:30,599 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:13:30,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:13:30,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:13:30,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:13:30,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:13:30,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:13:30,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:13:30,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:13:30,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:13:30,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:13:30,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:13:30,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:13:30,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:13:30,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:13:30,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:13:30,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:13:30,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:13:30,604 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 613ee8845912b921567ac9e82f8c414d8758c61c69ed2c2ac2cbc303a1b4f001 [2024-10-12 21:13:30,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:13:30,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:13:30,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:13:30,823 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:13:30,823 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:13:30,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i [2024-10-12 21:13:32,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:13:32,231 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:13:32,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i [2024-10-12 21:13:32,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e72ccfc/38722a4f4ebc48fda8c2b5b2d2a1ca9f/FLAG0ddc735de [2024-10-12 21:13:32,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e72ccfc/38722a4f4ebc48fda8c2b5b2d2a1ca9f [2024-10-12 21:13:32,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:13:32,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:13:32,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:13:32,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:13:32,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:13:32,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:13:32" (1/1) ... [2024-10-12 21:13:32,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46035e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32, skipping insertion in model container [2024-10-12 21:13:32,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:13:32" (1/1) ... [2024-10-12 21:13:32,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:13:32,811 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[1226,1239] [2024-10-12 21:13:32,832 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[2862,2875] [2024-10-12 21:13:32,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:13:32,840 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:13:32,849 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[1226,1239] [2024-10-12 21:13:32,856 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_1.i[2862,2875] [2024-10-12 21:13:32,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:13:32,872 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:13:32,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32 WrapperNode [2024-10-12 21:13:32,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:13:32,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:13:32,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:13:32,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:13:32,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32" (1/1) ... [2024-10-12 21:13:32,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32" (1/1) ... [2024-10-12 21:13:32,902 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 91 [2024-10-12 21:13:32,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:13:32,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:13:32,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:13:32,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:13:32,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32" (1/1) ... [2024-10-12 21:13:32,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32" (1/1) ... [2024-10-12 21:13:32,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32" (1/1) ... [2024-10-12 21:13:32,926 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]. [2024-10-12 21:13:32,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32" (1/1) ... [2024-10-12 21:13:32,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32" (1/1) ... [2024-10-12 21:13:32,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32" (1/1) ... [2024-10-12 21:13:32,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32" (1/1) ... [2024-10-12 21:13:32,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32" (1/1) ... [2024-10-12 21:13:32,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32" (1/1) ... [2024-10-12 21:13:32,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:13:32,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:13:32,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:13:32,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:13:32,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32" (1/1) ... [2024-10-12 21:13:32,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:13:32,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:13:32,967 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) [2024-10-12 21:13:32,972 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 [2024-10-12 21:13:33,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:13:33,002 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-10-12 21:13:33,002 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-10-12 21:13:33,003 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-10-12 21:13:33,003 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-10-12 21:13:33,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:13:33,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 21:13:33,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:13:33,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:13:33,063 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:13:33,065 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:13:33,230 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-10-12 21:13:33,230 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:13:33,260 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:13:33,260 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 21:13:33,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:13:33 BoogieIcfgContainer [2024-10-12 21:13:33,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:13:33,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:13:33,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:13:33,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:13:33,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:13:32" (1/3) ... [2024-10-12 21:13:33,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a47aa9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:13:33, skipping insertion in model container [2024-10-12 21:13:33,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:13:32" (2/3) ... [2024-10-12 21:13:33,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a47aa9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:13:33, skipping insertion in model container [2024-10-12 21:13:33,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:13:33" (3/3) ... [2024-10-12 21:13:33,276 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_1.i [2024-10-12 21:13:33,294 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:13:33,295 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:13:33,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:13:33,393 INFO L333 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, 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;@326f3b9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:13:33,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:13:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 21:13:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-12 21:13:33,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:13:33,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:13:33,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:13:33,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:13:33,412 INFO L85 PathProgramCache]: Analyzing trace with hash 210916014, now seen corresponding path program 1 times [2024-10-12 21:13:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:13:33,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705744741] [2024-10-12 21:13:33,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:13:33,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:13:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:13:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:13:33,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:13:33,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705744741] [2024-10-12 21:13:33,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705744741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:13:33,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:13:33,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:13:33,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672146728] [2024-10-12 21:13:33,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:13:33,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:13:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:13:33,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:13:33,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:13:33,716 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:13:33,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:13:33,785 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2024-10-12 21:13:33,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:13:33,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-12 21:13:33,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:13:33,794 INFO L225 Difference]: With dead ends: 64 [2024-10-12 21:13:33,794 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 21:13:33,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:13:33,801 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:13:33,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:13:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 21:13:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-10-12 21:13:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 21:13:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-10-12 21:13:33,828 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 9 [2024-10-12 21:13:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:13:33,828 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-12 21:13:33,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:13:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-10-12 21:13:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-12 21:13:33,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:13:33,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:13:33,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:13:33,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:13:33,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:13:33,830 INFO L85 PathProgramCache]: Analyzing trace with hash 268174316, now seen corresponding path program 1 times [2024-10-12 21:13:33,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:13:33,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144953389] [2024-10-12 21:13:33,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:13:33,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:13:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:13:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:13:33,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:13:33,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144953389] [2024-10-12 21:13:33,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144953389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:13:33,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:13:33,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:13:33,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143624916] [2024-10-12 21:13:33,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:13:33,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:13:33,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:13:33,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:13:33,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:13:33,921 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:13:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:13:33,949 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-10-12 21:13:33,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:13:33,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-12 21:13:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:13:33,950 INFO L225 Difference]: With dead ends: 34 [2024-10-12 21:13:33,950 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 21:13:33,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:13:33,951 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:13:33,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:13:33,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 21:13:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-12 21:13:33,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 21:13:33,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-10-12 21:13:33,961 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 9 [2024-10-12 21:13:33,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:13:33,961 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-10-12 21:13:33,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:13:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-10-12 21:13:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 21:13:33,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:13:33,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:13:33,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:13:33,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:13:33,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:13:33,965 INFO L85 PathProgramCache]: Analyzing trace with hash -291101499, now seen corresponding path program 1 times [2024-10-12 21:13:33,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:13:33,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049261903] [2024-10-12 21:13:33,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:13:33,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:13:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:13:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:13:34,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:13:34,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049261903] [2024-10-12 21:13:34,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049261903] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:13:34,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546339396] [2024-10-12 21:13:34,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:13:34,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:13:34,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:13:34,145 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) [2024-10-12 21:13:34,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 21:13:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:13:34,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 21:13:34,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:13:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:13:34,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:13:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:13:34,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546339396] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:13:34,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:13:34,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-12 21:13:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954550034] [2024-10-12 21:13:34,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:13:34,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:13:34,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:13:34,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:13:34,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:13:34,328 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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) [2024-10-12 21:13:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:13:34,407 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-10-12 21:13:34,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:13:34,407 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 [2024-10-12 21:13:34,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:13:34,408 INFO L225 Difference]: With dead ends: 35 [2024-10-12 21:13:34,408 INFO L226 Difference]: Without dead ends: 30 [2024-10-12 21:13:34,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:13:34,409 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:13:34,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:13:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-12 21:13:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-12 21:13:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 21:13:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-12 21:13:34,413 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2024-10-12 21:13:34,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:13:34,414 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-12 21:13:34,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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) [2024-10-12 21:13:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-12 21:13:34,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-12 21:13:34,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:13:34,414 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:13:34,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 21:13:34,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:13:34,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:13:34,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:13:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash -448782580, now seen corresponding path program 2 times [2024-10-12 21:13:34,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:13:34,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705262047] [2024-10-12 21:13:34,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:13:34,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:13:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:13:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:13:34,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:13:34,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705262047] [2024-10-12 21:13:34,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705262047] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:13:34,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989002159] [2024-10-12 21:13:34,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 21:13:34,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:13:34,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:13:34,944 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) [2024-10-12 21:13:34,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 21:13:34,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 21:13:34,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 21:13:35,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 21:13:35,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:13:44,041 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse3 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse0 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse2 (mod .cse1 256))) (and (<= 128 (mod (+ .cse0 .cse1) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse2 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse1) 256) 127) (= .cse2 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse4 (mod (+ .cse0 .cse5) 256))) (and (= .cse3 .cse4) (<= 128 (mod .cse5 256)) (<= 128 .cse4) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse5) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse6 (mod .cse7 256))) (and (= .cse6 .cse3) (<= 128 .cse6) (<= (mod (+ .cse0 .cse7) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse7) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse9 (mod .cse8 256))) (and (<= (mod (+ .cse0 .cse8) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse9 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse8) 256) 127) (= .cse9 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse10 (mod .cse11 256))) (and (= .cse10 .cse3) (<= 128 .cse10) (<= 128 (mod (+ .cse0 .cse11) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse11) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse13 (mod (+ .cse0 .cse12) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse12) 256)) (<= 128 (mod .cse12 256)) (<= .cse13 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse13))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse15 (mod .cse14 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse14) 256)) (<= (mod (+ .cse0 .cse14) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse15 127) (= .cse15 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse17 (mod (+ .cse0 .cse16) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse16) 256)) (<= .cse17 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse16 0)) (<= (mod .cse16 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse17))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse19 (mod .cse18 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse18) 256)) (= .cse19 .cse3) (<= 128 .cse19) (<= 128 (mod (+ .cse0 .cse18) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse20 (mod (+ .cse0 .cse21) 256))) (and (<= .cse20 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod .cse21 256) 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse21) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse20))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse23 (mod (+ .cse0 .cse22) 256))) (and (<= 128 (mod .cse22 256)) (<= .cse23 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse22) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse23))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse25 (mod (+ .cse0 .cse24) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse24) 256)) (= .cse3 .cse25) (<= 128 (mod .cse24 256)) (<= 128 .cse25) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse27 (mod (+ .cse0 .cse26) 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse26) 256)) (= .cse3 .cse27) (<= 128 .cse27) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse26 0)) (<= (mod .cse26 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse29 (mod .cse28 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse28) 256)) (<= 128 (mod (+ .cse0 .cse28) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|) (<= .cse29 127) (= .cse29 |c_ULTIMATE.start_gcd_test_~a#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse30 (mod (+ .cse0 .cse31) 256))) (and (= .cse3 .cse30) (<= 128 .cse30) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_18| 1) 0) (not (= .cse31 0)) (<= (mod .cse31 256) 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse31) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_18| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_18| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse33 (mod .cse32 256))) (and (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse32) 256)) (= .cse33 .cse3) (<= 128 .cse33) (<= (mod (+ .cse0 .cse32) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_18|))))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (let ((.cse44 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse69 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse68 (mod .cse44 256))) (let ((.cse47 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse57 (<= 128 .cse68)) (.cse51 (<= .cse69 127)) (.cse56 (<= 128 .cse69)) (.cse48 (<= .cse68 127)) (.cse49 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse50 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|)))))) (let ((.cse38 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse67 (mod .cse66 256))) (and (<= (mod (+ .cse44 .cse66) 256) 127) (= .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse67 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse66) 256)))))) (and .cse56 .cse48 .cse49 .cse50))) (.cse39 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse64 (mod .cse65 256))) (and (= .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse65) 256) 127) (<= .cse64 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ .cse44 .cse65) 256)))))) (and .cse49 .cse57 .cse50 .cse51))) (.cse41 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse63 (mod .cse62 256))) (and (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse62) 256) 127) (= .cse63 .cse47) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 .cse63) (<= 128 (mod (+ .cse44 .cse62) 256))))))) (.cse42 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse61 (mod .cse60 256))) (and (<= (mod (+ .cse44 .cse60) 256) 127) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse60) 256) 127) (= .cse61 .cse47) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 .cse61)))))) (.cse43 (or (and .cse56 .cse49 .cse57 .cse50) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse58 (mod .cse59 256))) (and (= .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse58 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse59) 256)) (<= 128 (mod (+ .cse44 .cse59) 256)))))))) (.cse40 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse54 (mod .cse55 256))) (and (= .cse54 .cse47) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse55) 256)) (<= 128 .cse54) (<= 128 (mod (+ .cse44 .cse55) 256))))))) (.cse34 (or (and .cse48 .cse49 .cse50 .cse51) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse53 (mod .cse52 256))) (and (<= (mod (+ .cse44 .cse52) 256) 127) (= .cse53 |c_ULTIMATE.start_gcd_test_~b#1|) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse52) 256) 127) (<= .cse53 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|))))))) (.cse36 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse35 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse37 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse46 (mod .cse45 256))) (and (<= (mod (+ .cse44 .cse45) 256) 127) (= .cse46 .cse47) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse45) 256)) (<= 128 .cse46))))))) (or (and .cse34 .cse35) (and .cse36 .cse37) (and .cse38 .cse35) (and .cse39 .cse35) (and .cse38 .cse36) (and .cse40 .cse35) (and .cse41 .cse35) (and .cse39 .cse36) (and .cse41 .cse36) (and .cse42 .cse36) (and .cse35 .cse43) (and .cse42 .cse35) (and .cse36 .cse43) (and .cse40 .cse36) (and .cse34 .cse36) (and .cse35 .cse37)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from true [2024-10-12 21:13:59,441 WARN L286 SmtUtils]: Spent 9.04s on a formula simplification. DAG size of input: 122 DAG size of output: 94 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-12 21:14:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-12 21:14:12,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:14:43,973 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-12 21:14:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:14:55,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989002159] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:14:55,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:14:55,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2024-10-12 21:14:55,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563302411] [2024-10-12 21:14:55,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:14:55,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 21:14:55,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:14:55,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 21:14:55,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=241, Unknown=7, NotChecked=32, Total=342 [2024-10-12 21:14:55,674 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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) [2024-10-12 21:14:59,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-12 21:15:03,994 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] [2024-10-12 21:15:12,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]