./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_3+newton_3_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/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 ../sv-benchmarks/c/combinations/gcd_3+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.graphml --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 cc7e3777189fad7ccb3c88448fa9a78354a62d55c3114c1026ddd9265244ab9e --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 19:53:58,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 19:53:58,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 19:53:58,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 19:53:58,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 19:53:58,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 19:53:58,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 19:53:58,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 19:53:58,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 19:53:58,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 19:53:58,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 19:53:58,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 19:53:58,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 19:53:58,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 19:53:58,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 19:53:58,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 19:53:58,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 19:53:58,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 19:53:58,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 19:53:58,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 19:53:58,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 19:53:58,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 19:53:58,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 19:53:58,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 19:53:58,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 19:53:58,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 19:53:58,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 19:53:58,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 19:53:58,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 19:53:58,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 19:53:58,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 19:53:58,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 19:53:58,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 19:53:58,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 19:53:58,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 19:53:58,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 19:53:58,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 19:53:58,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 19:53:58,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 19:53:58,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 19:53:58,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 19:53:58,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 19:53:58,293 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 19:53:58,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 19:53:58,296 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 19:53:58,297 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 19:53:58,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 19:53:58,298 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 19:53:58,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 19:53:58,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 19:53:58,299 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 19:53:58,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 19:53:58,303 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 19:53:58,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 19:53:58,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 19:53:58,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 19:53:58,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 19:53:58,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 19:53:58,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 19:53:58,304 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 19:53:58,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 19:53:58,305 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 19:53:58,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 19:53:58,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 19:53:58,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 19:53:58,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 19:53:58,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 19:53:58,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 19:53:58,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 19:53:58,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 19:53:58,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 19:53:58,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 19:53:58,308 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 19:53:58,308 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 19:53:58,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 19:53:58,308 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 19:53:58,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> cc7e3777189fad7ccb3c88448fa9a78354a62d55c3114c1026ddd9265244ab9e [2021-12-17 19:53:58,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 19:53:58,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 19:53:58,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 19:53:58,611 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 19:53:58,612 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 19:53:58,613 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_3+newton_3_1.i [2021-12-17 19:53:58,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4aabb8c6/13b42c9e24064e389068e4b5a1b6d8b7/FLAG1d4312a10 [2021-12-17 19:53:59,127 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 19:53:59,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_3_1.i [2021-12-17 19:53:59,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4aabb8c6/13b42c9e24064e389068e4b5a1b6d8b7/FLAG1d4312a10 [2021-12-17 19:53:59,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4aabb8c6/13b42c9e24064e389068e4b5a1b6d8b7 [2021-12-17 19:53:59,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 19:53:59,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 19:53:59,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 19:53:59,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 19:53:59,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 19:53:59,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:53:59" (1/1) ... [2021-12-17 19:53:59,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b9051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:53:59, skipping insertion in model container [2021-12-17 19:53:59,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:53:59" (1/1) ... [2021-12-17 19:53:59,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 19:53:59,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 19:53:59,704 WARN L230 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_3+newton_3_1.i[1226,1239] [2021-12-17 19:53:59,767 WARN L230 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_3+newton_3_1.i[2862,2875] [2021-12-17 19:53:59,769 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 19:53:59,775 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 19:53:59,798 WARN L230 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_3+newton_3_1.i[1226,1239] [2021-12-17 19:53:59,809 WARN L230 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_3+newton_3_1.i[2862,2875] [2021-12-17 19:53:59,813 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 19:53:59,826 INFO L208 MainTranslator]: Completed translation [2021-12-17 19:53:59,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:53:59 WrapperNode [2021-12-17 19:53:59,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 19:53:59,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 19:53:59,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 19:53:59,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 19:53:59,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:53:59" (1/1) ... [2021-12-17 19:53:59,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:53:59" (1/1) ... [2021-12-17 19:53:59,877 INFO L137 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 82 [2021-12-17 19:53:59,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 19:53:59,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 19:53:59,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 19:53:59,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 19:53:59,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:53:59" (1/1) ... [2021-12-17 19:53:59,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:53:59" (1/1) ... [2021-12-17 19:53:59,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:53:59" (1/1) ... [2021-12-17 19:53:59,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:53:59" (1/1) ... [2021-12-17 19:53:59,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:53:59" (1/1) ... [2021-12-17 19:53:59,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:53:59" (1/1) ... [2021-12-17 19:53:59,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:53:59" (1/1) ... [2021-12-17 19:53:59,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 19:53:59,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 19:53:59,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 19:53:59,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 19:53:59,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:53:59" (1/1) ... [2021-12-17 19:53:59,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 19:53:59,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:53:59,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 19:53:59,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 19:53:59,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 19:53:59,993 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2021-12-17 19:53:59,993 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2021-12-17 19:53:59,993 INFO L130 BoogieDeclarations]: Found specification of procedure f [2021-12-17 19:53:59,994 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2021-12-17 19:53:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 19:53:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 19:53:59,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 19:54:00,057 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 19:54:00,059 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 19:54:00,207 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 19:54:00,216 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 19:54:00,217 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 19:54:00,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:54:00 BoogieIcfgContainer [2021-12-17 19:54:00,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 19:54:00,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 19:54:00,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 19:54:00,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 19:54:00,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:53:59" (1/3) ... [2021-12-17 19:54:00,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c6fd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:54:00, skipping insertion in model container [2021-12-17 19:54:00,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:53:59" (2/3) ... [2021-12-17 19:54:00,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c6fd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:54:00, skipping insertion in model container [2021-12-17 19:54:00,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:54:00" (3/3) ... [2021-12-17 19:54:00,246 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_3_1.i [2021-12-17 19:54:00,250 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 19:54:00,251 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 19:54:00,314 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 19:54:00,321 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 19:54:00,322 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-17 19:54:00,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 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) [2021-12-17 19:54:00,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 19:54:00,351 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:54:00,351 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:54:00,352 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:54:00,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:54:00,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2021-12-17 19:54:00,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:54:00,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442707723] [2021-12-17 19:54:00,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:54:00,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:54:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:54:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:54:00,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:54:00,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442707723] [2021-12-17 19:54:00,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442707723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:54:00,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:54:00,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 19:54:00,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501070280] [2021-12-17 19:54:00,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:54:00,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 19:54:00,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:54:00,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 19:54:00,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 19:54:00,617 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 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.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-12-17 19:54:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:54:00,682 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2021-12-17 19:54:00,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 19:54:00,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 [2021-12-17 19:54:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:54:00,695 INFO L225 Difference]: With dead ends: 96 [2021-12-17 19:54:00,695 INFO L226 Difference]: Without dead ends: 39 [2021-12-17 19:54:00,698 INFO L932 BasicCegarLoop]: 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 [2021-12-17 19:54:00,705 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 19:54:00,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 134 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:54:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-17 19:54:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2021-12-17 19:54:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 19:54:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2021-12-17 19:54:00,742 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2021-12-17 19:54:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:54:00,743 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2021-12-17 19:54:00,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-12-17 19:54:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2021-12-17 19:54:00,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 19:54:00,745 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:54:00,745 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:54:00,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 19:54:00,745 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:54:00,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:54:00,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1776235347, now seen corresponding path program 1 times [2021-12-17 19:54:00,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:54:00,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242826407] [2021-12-17 19:54:00,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:54:00,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:54:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:54:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:54:00,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:54:00,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242826407] [2021-12-17 19:54:00,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242826407] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:54:00,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:54:00,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 19:54:00,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747596096] [2021-12-17 19:54:00,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:54:00,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 19:54:00,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:54:00,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 19:54:00,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 19:54:00,842 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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) [2021-12-17 19:54:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:54:00,910 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-12-17 19:54:00,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 19:54:00,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 [2021-12-17 19:54:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:54:00,912 INFO L225 Difference]: With dead ends: 39 [2021-12-17 19:54:00,912 INFO L226 Difference]: Without dead ends: 33 [2021-12-17 19:54:00,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 19:54:00,914 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 19:54:00,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 155 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:54:00,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-17 19:54:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-12-17 19:54:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 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) [2021-12-17 19:54:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2021-12-17 19:54:00,921 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2021-12-17 19:54:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:54:00,921 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2021-12-17 19:54:00,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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) [2021-12-17 19:54:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2021-12-17 19:54:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 19:54:00,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:54:00,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:54:00,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 19:54:00,923 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:54:00,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:54:00,924 INFO L85 PathProgramCache]: Analyzing trace with hash 830014046, now seen corresponding path program 1 times [2021-12-17 19:54:00,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:54:00,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628251590] [2021-12-17 19:54:00,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:54:00,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:54:00,934 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:54:00,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1916621868] [2021-12-17 19:54:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:54:00,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:54:00,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:54:00,939 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) [2021-12-17 19:54:00,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 19:54:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:54:00,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-17 19:54:00,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:54:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:54:25,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 19:54:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:54:31,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:54:31,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628251590] [2021-12-17 19:54:31,732 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:54:31,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916621868] [2021-12-17 19:54:31,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916621868] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 19:54:31,734 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 19:54:31,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-12-17 19:54:31,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473993804] [2021-12-17 19:54:31,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 19:54:31,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 19:54:31,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:54:31,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 19:54:31,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=208, Unknown=10, NotChecked=0, Total=272 [2021-12-17 19:54:31,736 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 19:54:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:54:31,985 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2021-12-17 19:54:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 19:54:31,986 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-17 19:54:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:54:31,986 INFO L225 Difference]: With dead ends: 41 [2021-12-17 19:54:31,988 INFO L226 Difference]: Without dead ends: 35 [2021-12-17 19:54:31,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=63, Invalid=233, Unknown=10, NotChecked=0, Total=306 [2021-12-17 19:54:31,989 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 19:54:31,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 287 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2021-12-17 19:54:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-17 19:54:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-12-17 19:54:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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) [2021-12-17 19:54:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-12-17 19:54:31,996 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2021-12-17 19:54:31,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:54:31,996 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-12-17 19:54:31,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 19:54:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-12-17 19:54:31,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 19:54:31,997 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:54:31,997 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:54:32,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 19:54:32,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:54:32,204 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:54:32,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:54:32,205 INFO L85 PathProgramCache]: Analyzing trace with hash 20667420, now seen corresponding path program 1 times [2021-12-17 19:54:32,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:54:32,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708324016] [2021-12-17 19:54:32,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:54:32,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:54:32,213 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:54:32,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584674557] [2021-12-17 19:54:32,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:54:32,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:54:32,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:54:32,216 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) [2021-12-17 19:54:32,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 19:54:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:54:32,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-17 19:54:32,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:55:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:55:04,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 19:55:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:55:14,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:55:14,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708324016] [2021-12-17 19:55:14,408 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:55:14,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584674557] [2021-12-17 19:55:14,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584674557] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 19:55:14,409 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 19:55:14,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-12-17 19:55:14,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497270099] [2021-12-17 19:55:14,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 19:55:14,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 19:55:14,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:55:14,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 19:55:14,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=172, Unknown=15, NotChecked=0, Total=240 [2021-12-17 19:55:14,411 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 19:55:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:55:15,368 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2021-12-17 19:55:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 19:55:15,371 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-17 19:55:15,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:55:15,372 INFO L225 Difference]: With dead ends: 46 [2021-12-17 19:55:15,372 INFO L226 Difference]: Without dead ends: 37 [2021-12-17 19:55:15,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 40.8s TimeCoverageRelationStatistics Valid=62, Invalid=195, Unknown=15, NotChecked=0, Total=272 [2021-12-17 19:55:15,373 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 19:55:15,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 281 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2021-12-17 19:55:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-17 19:55:15,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2021-12-17 19:55:15,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 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) [2021-12-17 19:55:15,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2021-12-17 19:55:15,387 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 12 [2021-12-17 19:55:15,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:55:15,387 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2021-12-17 19:55:15,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 19:55:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2021-12-17 19:55:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 19:55:15,390 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:55:15,390 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:55:15,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 19:55:15,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-17 19:55:15,612 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:55:15,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:55:15,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1518646018, now seen corresponding path program 2 times [2021-12-17 19:55:15,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:55:15,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877125115] [2021-12-17 19:55:15,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:55:15,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:55:15,647 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:55:15,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642314255] [2021-12-17 19:55:15,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 19:55:15,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:55:15,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:55:15,661 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) [2021-12-17 19:55:15,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 19:55:15,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 19:55:15,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 19:55:15,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-17 19:55:15,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:55:36,375 WARN L227 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 19:55:51,885 WARN L227 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 19:56:09,739 WARN L227 SmtUtils]: Spent 5.78s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 19:56:27,744 WARN L227 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 19:56:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:56:55,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 19:57:16,139 WARN L860 $PredicateComparison]: unable to prove that (or (<= |c_ULTIMATE.start_main1_~x~0#1| 0) (let ((.cse1 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse4 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse5 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (let ((.cse0 (mod .cse5 256))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse0) (let ((.cse2 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse0) 256)))) (.cse3 (<= .cse0 |c_ULTIMATE.start_main1_~x~0#1|))) (and (or .cse1 .cse2 .cse3) (or .cse2 .cse3 .cse4))))) (or (= 0 .cse5) (let ((.cse11 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse5) 256))) (let ((.cse7 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse11) 256)))) (.cse8 (<= .cse11 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse6 (< 127 .cse11))) (and (or .cse1 .cse6 .cse7 .cse8) (let ((.cse12 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse5) 256))) (or (let ((.cse9 (<= .cse12 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse10 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse12) 256))))) (and (or (and (or .cse4 .cse9 .cse10) (or .cse1 .cse7 .cse8)) .cse6) (or (<= .cse11 127) .cse4 .cse9 .cse10))) (< 127 .cse12)))))) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)))) (= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) is different from true [2021-12-17 19:57:34,702 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse5 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse6 (= 0 .cse5))) (and (or (let ((.cse2 (mod .cse5 256))) (and (let ((.cse3 (+ .cse2 (- 256)))) (let ((.cse0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse3) 256))) (or (<= .cse0 |c_ULTIMATE.start_main1_~x~0#1|) .cse1 (<= .cse2 127) (not (= 0 (mod (mod .cse3 .cse0) 256)))))) (let ((.cse4 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse2) 256))) (or (< 127 .cse2) (not (= 0 (mod (mod .cse2 .cse4) 256))) (<= .cse4 |c_ULTIMATE.start_main1_~x~0#1|) (= 0 .cse2) .cse1)))) (and (not .cse6) (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (or (let ((.cse10 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse5) 256))) (let ((.cse7 (<= .cse10 127)) (.cse13 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse5) 256))) (and (or (let ((.cse12 (+ .cse13 (- 256)))) (let ((.cse11 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse12) 256))) (let ((.cse8 (not (= 0 (mod (mod .cse12 .cse11) 256)))) (.cse9 (<= .cse11 |c_ULTIMATE.start_main1_~x~0#1|))) (and (or .cse7 .cse8 .cse9 .cse1) (or .cse8 .cse9 (< 127 .cse10) .cse1))))) (<= .cse13 127)) (or (let ((.cse17 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse13) 256))) (let ((.cse14 (= 0 .cse13)) (.cse15 (not (= 0 (mod (mod .cse13 .cse17) 256)))) (.cse16 (<= .cse17 |c_ULTIMATE.start_main1_~x~0#1|))) (and (or .cse14 .cse15 .cse1 .cse16) (or .cse14 .cse7 .cse15 .cse1 .cse16)))) (< 127 .cse13))))) .cse6 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))))) (<= |c_ULTIMATE.start_main1_~x~0#1| 0)) is different from true [2021-12-17 19:57:54,929 WARN L860 $PredicateComparison]: unable to prove that (or (<= |c_ULTIMATE.start_main1_~x~0#1| 0) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse0 (mod (* |ULTIMATE.start_gcd_test_~b#1| 255) 256))) (or (< 127 .cse0) (let ((.cse3 (mod |c_ULTIMATE.start_gcd_test_~a#1| .cse0))) (and (let ((.cse1 (mod .cse3 256))) (let ((.cse2 (mod (mod .cse0 .cse1) 256))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (not (= 0 (mod (mod .cse1 .cse2) 256))) (= 0 .cse1) (<= .cse2 |c_ULTIMATE.start_main1_~x~0#1|)))) (let ((.cse5 (+ (mod (+ (* .cse0 255) .cse3) 256) (- 256)))) (let ((.cse4 (mod (mod .cse0 .cse5) 256))) (or (<= .cse4 |c_ULTIMATE.start_main1_~x~0#1|) (not (= 0 (mod (mod .cse5 .cse4) 256))) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)))))))))) is different from true [2021-12-17 19:58:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-17 19:58:02,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:58:02,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877125115] [2021-12-17 19:58:02,237 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:58:02,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642314255] [2021-12-17 19:58:02,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642314255] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 19:58:02,238 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 19:58:02,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-12-17 19:58:02,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586537546] [2021-12-17 19:58:02,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 19:58:02,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 19:58:02,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:58:02,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 19:58:02,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=224, Unknown=23, NotChecked=102, Total=420 [2021-12-17 19:58:02,239 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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) [2021-12-17 19:58:04,436 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse18 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (or (let ((.cse5 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse6 (= 0 .cse5))) (and (or (let ((.cse2 (mod .cse5 256))) (and (let ((.cse3 (+ .cse2 (- 256)))) (let ((.cse0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse3) 256))) (or (<= .cse0 |c_ULTIMATE.start_main1_~x~0#1|) .cse1 (<= .cse2 127) (not (= 0 (mod (mod .cse3 .cse0) 256)))))) (let ((.cse4 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse2) 256))) (or (< 127 .cse2) (not (= 0 (mod (mod .cse2 .cse4) 256))) (<= .cse4 |c_ULTIMATE.start_main1_~x~0#1|) (= 0 .cse2) .cse1)))) (and (not .cse6) (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (or (let ((.cse10 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse5) 256))) (let ((.cse7 (<= .cse10 127)) (.cse13 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse5) 256))) (and (or (let ((.cse12 (+ .cse13 (- 256)))) (let ((.cse11 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse12) 256))) (let ((.cse8 (not (= 0 (mod (mod .cse12 .cse11) 256)))) (.cse9 (<= .cse11 |c_ULTIMATE.start_main1_~x~0#1|))) (and (or .cse7 .cse8 .cse9 .cse1) (or .cse8 .cse9 (< 127 .cse10) .cse1))))) (<= .cse13 127)) (or (let ((.cse17 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse13) 256))) (let ((.cse14 (= 0 .cse13)) (.cse15 (not (= 0 (mod (mod .cse13 .cse17) 256)))) (.cse16 (<= .cse17 |c_ULTIMATE.start_main1_~x~0#1|))) (and (or .cse14 .cse15 .cse1 .cse16) (or .cse14 .cse7 .cse15 .cse1 .cse16)))) (< 127 .cse13))))) .cse6 .cse18)))) (<= |c_ULTIMATE.start_main1_~x~0#1| 0)) .cse18 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int)) (let ((.cse19 (mod (* |v_ULTIMATE.start_gcd_test_~b#1_17| 255) 256))) (and (< 127 .cse19) (= (+ |c_ULTIMATE.start_gcd_test_~b#1| 256) .cse19)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int)) (let ((.cse20 (mod (* |v_ULTIMATE.start_gcd_test_~b#1_17| 255) 256))) (and (<= .cse20 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse20))))) (= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~x~0#1|))) is different from true [2021-12-17 19:58:05,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:58:05,162 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2021-12-17 19:58:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 19:58:05,162 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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 14 [2021-12-17 19:58:05,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:58:05,163 INFO L225 Difference]: With dead ends: 49 [2021-12-17 19:58:05,163 INFO L226 Difference]: Without dead ends: 40 [2021-12-17 19:58:05,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 113.6s TimeCoverageRelationStatistics Valid=84, Invalid=250, Unknown=24, NotChecked=148, Total=506 [2021-12-17 19:58:05,165 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 19:58:05,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 293 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 140 Unchecked, 0.1s Time] [2021-12-17 19:58:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-17 19:58:05,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2021-12-17 19:58:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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) [2021-12-17 19:58:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2021-12-17 19:58:05,170 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 14 [2021-12-17 19:58:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:58:05,170 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2021-12-17 19:58:05,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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) [2021-12-17 19:58:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2021-12-17 19:58:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 19:58:05,171 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:58:05,171 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:58:05,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-17 19:58:05,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:58:05,376 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:58:05,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:58:05,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1911673028, now seen corresponding path program 2 times [2021-12-17 19:58:05,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:58:05,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116971192] [2021-12-17 19:58:05,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:58:05,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:58:05,383 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:58:05,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545641118] [2021-12-17 19:58:05,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 19:58:05,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:58:05,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:58:05,385 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) [2021-12-17 19:58:05,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 19:58:05,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 19:58:05,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 19:58:05,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-17 19:58:05,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:58:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:58:30,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 19:59:26,998 WARN L227 SmtUtils]: Spent 31.50s on a formula simplification. DAG size of input: 56 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 20:02:50,901 WARN L860 $PredicateComparison]: unable to prove that (or (<= |c_ULTIMATE.start_main1_~x~0#1| 0) (= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (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|) (let ((.cse15 (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (.cse7 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (= 0 .cse0) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse14 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse16 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse0) 256))) (let ((.cse4 (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse16) 256))) (or .cse14 (not (= 0 (mod (mod .cse16 .cse17) 256))) (<= .cse17 |c_ULTIMATE.start_main1_~x~0#1|) .cse15 (= 0 .cse16)))) (.cse5 (< 127 .cse16)) (.cse1 (<= .cse16 127)) (.cse2 (let ((.cse12 (+ .cse16 (- 256)))) (let ((.cse13 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse12) 256))) (or (not (= 0 (mod (mod .cse12 .cse13) 256))) .cse14 (<= .cse13 |c_ULTIMATE.start_main1_~x~0#1|) .cse15)))) (.cse9 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse0) 256))) (and (or (let ((.cse3 (let ((.cse8 (+ .cse9 (- 256)))) (let ((.cse6 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse8) 256))) (or (<= .cse6 |c_ULTIMATE.start_main1_~x~0#1|) .cse7 (not (= 0 (mod (mod .cse8 .cse6) 256)))))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse3) .cse5))) (<= .cse9 127)) (or (let ((.cse10 (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse9) 256))) (or (= 0 .cse9) (<= .cse11 |c_ULTIMATE.start_main1_~x~0#1|) (not (= 0 (mod (mod .cse9 .cse11) 256))) .cse7)))) (and (or (and .cse4 .cse10) .cse5) (or .cse1 (and .cse2 .cse10)))) (< 127 .cse9)))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse19 (mod .cse0 256))) (and (let ((.cse18 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse19) 256))) (or (<= .cse18 |c_ULTIMATE.start_main1_~x~0#1|) (< 127 .cse19) (= 0 .cse19) (not (= 0 (mod (mod .cse19 .cse18) 256))) .cse15)) (or (<= .cse19 127) (let ((.cse22 (+ .cse19 (- 256)))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse22) 256))) (let ((.cse20 (<= .cse23 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse21 (not (= 0 (mod (mod .cse22 .cse23) 256))))) (and (or .cse20 .cse21 .cse15) (or .cse20 .cse7 .cse21)))))))))))))) is different from true [2021-12-17 20:03:28,468 WARN L860 $PredicateComparison]: unable to prove that (or (<= |c_ULTIMATE.start_main1_~x~0#1| 0) (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|) (let ((.cse4 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (let ((.cse0 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse4) 256))) (and (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse0) 256))) (or (= 0 .cse0) (<= .cse1 |c_ULTIMATE.start_main1_~x~0#1|) (not (= 0 (mod (mod .cse0 .cse1) 256))) (< 127 .cse0))) (let ((.cse3 (+ .cse0 (- 256)))) (let ((.cse2 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse3) 256))) (or (<= .cse2 |c_ULTIMATE.start_main1_~x~0#1|) (not (= 0 (mod (mod .cse3 .cse2) 256))) (<= .cse0 127)))))) (= 0 .cse4) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse6 (mod .cse4 256))) (and (let ((.cse5 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse6) 256))) (or (<= .cse5 |c_ULTIMATE.start_main1_~x~0#1|) (< 127 .cse6) (= 0 .cse6) (not (= 0 (mod (mod .cse6 .cse5) 256))))) (let ((.cse8 (+ .cse6 (- 256)))) (let ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse8) 256))) (or (<= .cse7 |c_ULTIMATE.start_main1_~x~0#1|) (<= .cse6 127) (not (= 0 (mod (mod .cse8 .cse7) 256))))))))))))) (= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2021-12-17 20:03:37,473 WARN L860 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (<= |c_ULTIMATE.start_main1_~x~0#1| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (or (let ((.cse1 (mod (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (and (let ((.cse0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse1) 256))) (or (<= .cse0 |c_ULTIMATE.start_main1_~x~0#1|) (< 127 .cse1) (= 0 .cse1) (not (= 0 (mod (mod .cse1 .cse0) 256))))) (let ((.cse3 (+ .cse1 (- 256)))) (let ((.cse2 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse3) 256))) (or (<= .cse2 |c_ULTIMATE.start_main1_~x~0#1|) (<= .cse1 127) (not (= 0 (mod (mod .cse3 .cse2) 256)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~b#1|))) (= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2021-12-17 20:03:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-17 20:03:37,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 20:03:37,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116971192] [2021-12-17 20:03:37,499 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 20:03:37,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545641118] [2021-12-17 20:03:37,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545641118] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 20:03:37,500 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 20:03:37,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-12-17 20:03:37,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053421862] [2021-12-17 20:03:37,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 20:03:37,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 20:03:37,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 20:03:37,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 20:03:37,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=233, Unknown=16, NotChecked=102, Total=420 [2021-12-17 20:03:37,501 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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) [2021-12-17 20:03:58,517 WARN L227 SmtUtils]: Spent 14.48s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 20:04:19,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 20:04:19,998 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2021-12-17 20:04:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 20:04:19,999 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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 14 [2021-12-17 20:04:19,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 20:04:19,999 INFO L225 Difference]: With dead ends: 52 [2021-12-17 20:04:20,000 INFO L226 Difference]: Without dead ends: 43 [2021-12-17 20:04:20,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 116.5s TimeCoverageRelationStatistics Valid=104, Invalid=346, Unknown=24, NotChecked=126, Total=600 [2021-12-17 20:04:20,001 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 20:04:20,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 225 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 139 Unchecked, 0.5s Time] [2021-12-17 20:04:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-17 20:04:20,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2021-12-17 20:04:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 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) [2021-12-17 20:04:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-12-17 20:04:20,006 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 14 [2021-12-17 20:04:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 20:04:20,006 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-12-17 20:04:20,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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) [2021-12-17 20:04:20,006 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-12-17 20:04:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 20:04:20,007 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 20:04:20,007 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 20:04:20,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 20:04:20,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 20:04:20,212 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 20:04:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 20:04:20,212 INFO L85 PathProgramCache]: Analyzing trace with hash 571830174, now seen corresponding path program 3 times [2021-12-17 20:04:20,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 20:04:20,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732433413] [2021-12-17 20:04:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 20:04:20,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 20:04:20,219 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 20:04:20,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2093194591] [2021-12-17 20:04:20,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 20:04:20,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 20:04:20,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 20:04:20,221 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) [2021-12-17 20:04:20,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 20:04:20,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 20:04:20,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 20:04:20,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-17 20:04:20,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... Killed by 15