/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench/lcm2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 17:17:17,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 17:17:17,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 17:17:17,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 17:17:17,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 17:17:17,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 17:17:17,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 17:17:17,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 17:17:17,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 17:17:17,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 17:17:17,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 17:17:17,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 17:17:17,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 17:17:17,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 17:17:17,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 17:17:17,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 17:17:17,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 17:17:17,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 17:17:17,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 17:17:17,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 17:17:17,228 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 17:17:17,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 17:17:17,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 17:17:17,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 17:17:17,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 17:17:17,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 17:17:17,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 17:17:17,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 17:17:17,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 17:17:17,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 17:17:17,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 17:17:17,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 17:17:17,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 17:17:17,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 17:17:17,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 17:17:17,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 17:17:17,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 17:17:17,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 17:17:17,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 17:17:17,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 17:17:17,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 17:17:17,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 17:17:17,239 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 17:17:17,246 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 17:17:17,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 17:17:17,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 17:17:17,247 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 17:17:17,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 17:17:17,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 17:17:17,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 17:17:17,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 17:17:17,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 17:17:17,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 17:17:17,248 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 17:17:17,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 17:17:17,248 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 17:17:17,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 17:17:17,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 17:17:17,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 17:17:17,249 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 17:17:17,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 17:17:17,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:17:17,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 17:17:17,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 17:17:17,250 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 17:17:17,250 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 17:17:17,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 17:17:17,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 17:17:17,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 17:17:17,494 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 17:17:17,495 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 17:17:17,497 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/lcm2.c [2022-04-27 17:17:17,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b87e0b5/196c3fe29a284384ac4025e4d798dfed/FLAGa82617c62 [2022-04-27 17:17:17,950 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 17:17:17,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/lcm2.c [2022-04-27 17:17:17,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b87e0b5/196c3fe29a284384ac4025e4d798dfed/FLAGa82617c62 [2022-04-27 17:17:17,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b87e0b5/196c3fe29a284384ac4025e4d798dfed [2022-04-27 17:17:17,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 17:17:17,979 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 17:17:17,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 17:17:17,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 17:17:17,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 17:17:17,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:17:17" (1/1) ... [2022-04-27 17:17:17,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca1abce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:17:17, skipping insertion in model container [2022-04-27 17:17:17,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:17:17" (1/1) ... [2022-04-27 17:17:17,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 17:17:18,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 17:17:18,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/lcm2.c[537,550] [2022-04-27 17:17:18,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:17:18,192 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 17:17:18,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/lcm2.c[537,550] [2022-04-27 17:17:18,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:17:18,255 INFO L208 MainTranslator]: Completed translation [2022-04-27 17:17:18,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:17:18 WrapperNode [2022-04-27 17:17:18,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 17:17:18,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 17:17:18,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 17:17:18,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 17:17:18,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:17:18" (1/1) ... [2022-04-27 17:17:18,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:17:18" (1/1) ... [2022-04-27 17:17:18,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:17:18" (1/1) ... [2022-04-27 17:17:18,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:17:18" (1/1) ... [2022-04-27 17:17:18,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:17:18" (1/1) ... [2022-04-27 17:17:18,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:17:18" (1/1) ... [2022-04-27 17:17:18,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:17:18" (1/1) ... [2022-04-27 17:17:18,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 17:17:18,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 17:17:18,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 17:17:18,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 17:17:18,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:17:18" (1/1) ... [2022-04-27 17:17:18,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:17:18,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:17:18,357 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) [2022-04-27 17:17:18,369 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 [2022-04-27 17:17:18,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 17:17:18,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 17:17:18,391 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 17:17:18,391 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 17:17:18,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 17:17:18,391 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 17:17:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 17:17:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 17:17:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 17:17:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 17:17:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 17:17:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 17:17:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 17:17:18,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 17:17:18,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 17:17:18,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 17:17:18,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 17:17:18,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 17:17:18,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 17:17:18,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 17:17:18,450 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 17:17:18,451 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 17:17:18,635 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 17:17:18,643 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 17:17:18,643 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 17:17:18,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:17:18 BoogieIcfgContainer [2022-04-27 17:17:18,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 17:17:18,645 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 17:17:18,645 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 17:17:18,660 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 17:17:18,662 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:17:18" (1/1) ... [2022-04-27 17:17:18,663 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 17:17:18,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:17:18 BasicIcfg [2022-04-27 17:17:18,698 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 17:17:18,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 17:17:18,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 17:17:18,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 17:17:18,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 05:17:17" (1/4) ... [2022-04-27 17:17:18,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6554e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:17:18, skipping insertion in model container [2022-04-27 17:17:18,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:17:18" (2/4) ... [2022-04-27 17:17:18,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6554e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:17:18, skipping insertion in model container [2022-04-27 17:17:18,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:17:18" (3/4) ... [2022-04-27 17:17:18,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6554e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:17:18, skipping insertion in model container [2022-04-27 17:17:18,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:17:18" (4/4) ... [2022-04-27 17:17:18,704 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm2.cJordan [2022-04-27 17:17:18,732 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 17:17:18,732 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 17:17:18,773 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 17:17:18,788 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6ae3ff3d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b8b81c2 [2022-04-27 17:17:18,789 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 17:17:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 17:17:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 17:17:18,802 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:17:18,803 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:17:18,803 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:17:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:17:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash -959097297, now seen corresponding path program 1 times [2022-04-27 17:17:18,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:17:18,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166011398] [2022-04-27 17:17:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:17:18,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:17:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:17:18,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:17:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:17:19,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {55#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {34#true} is VALID [2022-04-27 17:17:19,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 17:17:19,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 17:17:19,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:17:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:17:19,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [83] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-27 17:17:19,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [85] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} [108] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#false} is VALID [2022-04-27 17:17:19,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 17:17:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:17:19,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [83] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-27 17:17:19,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [85] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} [109] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-27 17:17:19,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 17:17:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:17:19,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [83] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-27 17:17:19,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [85] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} [110] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#false} is VALID [2022-04-27 17:17:19,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 17:17:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:17:19,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [83] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-27 17:17:19,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [85] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} [111] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-27 17:17:19,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {55#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:17:19,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {55#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {34#true} is VALID [2022-04-27 17:17:19,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 17:17:19,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 17:17:19,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 17:17:19,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [79] mainENTRY-->L24: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_5, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {34#true} is VALID [2022-04-27 17:17:19,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} [81] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {34#true} is VALID [2022-04-27 17:17:19,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} [83] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-27 17:17:19,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} [85] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,069 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} [108] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#false} is VALID [2022-04-27 17:17:19,069 INFO L272 TraceCheckUtils]: 11: Hoare triple {35#false} [82] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {34#true} is VALID [2022-04-27 17:17:19,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#true} [83] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-27 17:17:19,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#true} [85] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,070 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35#false} {35#false} [109] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-27 17:17:19,070 INFO L272 TraceCheckUtils]: 16: Hoare triple {35#false} [84] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {34#true} is VALID [2022-04-27 17:17:19,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#true} [83] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-27 17:17:19,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {34#true} [85] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#false} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,071 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {35#false} {35#false} [110] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#false} is VALID [2022-04-27 17:17:19,071 INFO L272 TraceCheckUtils]: 21: Hoare triple {35#false} [87] L27-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {34#true} is VALID [2022-04-27 17:17:19,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {34#true} [83] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-27 17:17:19,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {34#true} [85] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#false} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,073 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {35#false} {35#false} [111] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-27 17:17:19,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {35#false} [89] L28-->L41-2: Formula: (and (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~v~0_6) (= v_main_~a~0_7 v_main_~x~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {35#false} is VALID [2022-04-27 17:17:19,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {35#false} [90] L41-2-->L35-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,073 INFO L272 TraceCheckUtils]: 28: Hoare triple {35#false} [93] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* (* 2 v_main_~a~0_12) v_main_~b~0_12) 4294967296) (mod (+ (* v_main_~x~0_11 v_main_~u~0_9) (* v_main_~y~0_11 v_main_~v~0_9)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_9, main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_11, main_~b~0=v_main_~b~0_12, main_~u~0=v_main_~u~0_9, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {35#false} is VALID [2022-04-27 17:17:19,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {35#false} [96] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35#false} is VALID [2022-04-27 17:17:19,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {35#false} [100] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {35#false} [104] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 17:17:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 17:17:19,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:17:19,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166011398] [2022-04-27 17:17:19,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166011398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:17:19,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:17:19,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 17:17:19,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627531953] [2022-04-27 17:17:19,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:17:19,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 17:17:19,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:17:19,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:17:19,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:17:19,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 17:17:19,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:17:19,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 17:17:19,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:17:19,140 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:17:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:17:19,247 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-27 17:17:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 17:17:19,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 17:17:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:17:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:17:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-27 17:17:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:17:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-27 17:17:19,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-04-27 17:17:19,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:17:19,327 INFO L225 Difference]: With dead ends: 31 [2022-04-27 17:17:19,328 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 17:17:19,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:17:19,332 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:17:19,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:17:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 17:17:19,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 17:17:19,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:17:19,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 17:17:19,351 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 17:17:19,351 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 17:17:19,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:17:19,354 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 17:17:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 17:17:19,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:17:19,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:17:19,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 26 states. [2022-04-27 17:17:19,355 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 26 states. [2022-04-27 17:17:19,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:17:19,358 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 17:17:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 17:17:19,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:17:19,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:17:19,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:17:19,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:17:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 17:17:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-27 17:17:19,361 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 32 [2022-04-27 17:17:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:17:19,361 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-27 17:17:19,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 17:17:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 17:17:19,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 17:17:19,362 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:17:19,362 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:17:19,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 17:17:19,363 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:17:19,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:17:19,363 INFO L85 PathProgramCache]: Analyzing trace with hash 113255120, now seen corresponding path program 1 times [2022-04-27 17:17:19,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:17:19,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798260254] [2022-04-27 17:17:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:17:19,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:17:19,381 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:17:19,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206681117] [2022-04-27 17:17:19,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:17:19,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:17:19,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:17:19,396 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) [2022-04-27 17:17:19,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 17:17:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:17:19,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 17:17:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:17:19,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:17:19,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {167#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#true} is VALID [2022-04-27 17:17:19,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#true} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {167#true} is VALID [2022-04-27 17:17:19,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {167#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#true} is VALID [2022-04-27 17:17:19,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {167#true} {167#true} [107] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#true} is VALID [2022-04-27 17:17:19,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {167#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#true} is VALID [2022-04-27 17:17:19,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {167#true} [79] mainENTRY-->L24: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_5, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {167#true} is VALID [2022-04-27 17:17:19,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {167#true} [81] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {167#true} is VALID [2022-04-27 17:17:19,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#true} [83] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {167#true} is VALID [2022-04-27 17:17:19,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {167#true} [86] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {167#true} is VALID [2022-04-27 17:17:19,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#true} is VALID [2022-04-27 17:17:19,924 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {167#true} {167#true} [108] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 (mod v_main_~a~0_9 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {167#true} is VALID [2022-04-27 17:17:19,924 INFO L272 TraceCheckUtils]: 11: Hoare triple {167#true} [82] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {167#true} is VALID [2022-04-27 17:17:19,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#true} [83] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {167#true} is VALID [2022-04-27 17:17:19,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {167#true} [86] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {167#true} is VALID [2022-04-27 17:17:19,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {167#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#true} is VALID [2022-04-27 17:17:19,925 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {167#true} {167#true} [109] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_9 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {167#true} is VALID [2022-04-27 17:17:19,925 INFO L272 TraceCheckUtils]: 16: Hoare triple {167#true} [84] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {167#true} is VALID [2022-04-27 17:17:19,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {167#true} [83] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {167#true} is VALID [2022-04-27 17:17:19,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {167#true} [86] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {167#true} is VALID [2022-04-27 17:17:19,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {167#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#true} is VALID [2022-04-27 17:17:19,925 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {167#true} {167#true} [110] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= (mod v_main_~a~0_10 4294967296) 65535) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {167#true} is VALID [2022-04-27 17:17:19,925 INFO L272 TraceCheckUtils]: 21: Hoare triple {167#true} [87] L27-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {167#true} is VALID [2022-04-27 17:17:19,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {167#true} [83] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {167#true} is VALID [2022-04-27 17:17:19,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {167#true} [86] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {167#true} is VALID [2022-04-27 17:17:19,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {167#true} [88] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#true} is VALID [2022-04-27 17:17:19,926 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {167#true} {167#true} [111] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_10 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {167#true} is VALID [2022-04-27 17:17:19,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {167#true} [89] L28-->L41-2: Formula: (and (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~v~0_6) (= v_main_~a~0_7 v_main_~x~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {250#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 17:17:19,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {250#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [92] L41-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 17:17:19,928 INFO L272 TraceCheckUtils]: 28: Hoare triple {250#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [94] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* (* 2 v_main_~a~0_11) v_main_~b~0_11) 4294967296) (mod (+ (* v_main_~y~0_10 v_main_~v~0_8) (* v_main_~x~0_10 v_main_~u~0_8)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_11, main_~u~0=v_main_~u~0_8, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {257#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 17:17:19,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {257#(= |__VERIFIER_assert_#in~cond| 1)} [96] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:17:19,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {261#(<= 1 __VERIFIER_assert_~cond)} [100] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {168#false} is VALID [2022-04-27 17:17:19,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {168#false} [104] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {168#false} is VALID [2022-04-27 17:17:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 17:17:19,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:17:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:17:19,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798260254] [2022-04-27 17:17:19,930 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:17:19,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206681117] [2022-04-27 17:17:19,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206681117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:17:19,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:17:19,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:17:19,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064113221] [2022-04-27 17:17:19,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:17:19,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-27 17:17:19,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:17:19,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 17:17:19,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:17:19,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:17:19,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:17:19,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:17:19,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:17:19,954 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 17:17:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:17:20,112 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-27 17:17:20,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:17:20,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-27 17:17:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:17:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 17:17:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 17:17:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 17:17:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 17:17:20,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-27 17:17:20,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:17:20,160 INFO L225 Difference]: With dead ends: 35 [2022-04-27 17:17:20,161 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 17:17:20,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 17:17:20,162 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:17:20,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:17:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 17:17:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-27 17:17:20,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:17:20,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 17:17:20,166 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 17:17:20,167 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 17:17:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:17:20,169 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-27 17:17:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-27 17:17:20,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:17:20,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:17:20,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 34 states. [2022-04-27 17:17:20,170 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 34 states. [2022-04-27 17:17:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:17:20,172 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-27 17:17:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-27 17:17:20,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:17:20,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:17:20,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:17:20,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:17:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 17:17:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-04-27 17:17:20,174 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 32 [2022-04-27 17:17:20,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:17:20,174 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-04-27 17:17:20,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 17:17:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-27 17:17:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 17:17:20,175 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:17:20,175 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:17:20,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 17:17:20,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:17:20,395 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:17:20,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:17:20,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1078128450, now seen corresponding path program 1 times [2022-04-27 17:17:20,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:17:20,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260261497] [2022-04-27 17:17:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:17:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:17:20,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:17:20,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940172823] [2022-04-27 17:17:20,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:17:20,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:17:20,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:17:20,413 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) [2022-04-27 17:17:20,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process