/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:52:50,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:52:50,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:52:50,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:52:50,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:52:50,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:52:50,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:52:50,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:52:50,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:52:50,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:52:50,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:52:50,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:52:50,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:52:50,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:52:50,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:52:50,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:52:50,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:52:50,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:52:50,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:52:50,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:52:50,189 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:52:50,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:52:50,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:52:50,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:52:50,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:52:50,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:52:50,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:52:50,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:52:50,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:52:50,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:52:50,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:52:50,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:52:50,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:52:50,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:52:50,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:52:50,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:52:50,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:52:50,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:52:50,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:52:50,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:52:50,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:52:50,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:52:50,224 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:52:50,230 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:52:50,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:52:50,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:52:50,231 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:52:50,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:52:50,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:52:50,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:52:50,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:52:50,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:52:50,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:52:50,231 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:52:50,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:52:50,231 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:52:50,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:52:50,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:52:50,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:52:50,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:52:50,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:52:50,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:52:50,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:52:50,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:52:50,232 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:52:50,232 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:52:50,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:52:50,233 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:52:50,233 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-15 07:52:50,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:52:50,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:52:50,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:52:50,406 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:52:50,407 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:52:50,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound1.c [2022-04-15 07:52:50,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f0623bd/c8f5a995cfa14755a4c7b79a542a2b66/FLAGb58996ea1 [2022-04-15 07:52:50,777 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:52:50,777 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound1.c [2022-04-15 07:52:50,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f0623bd/c8f5a995cfa14755a4c7b79a542a2b66/FLAGb58996ea1 [2022-04-15 07:52:50,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f0623bd/c8f5a995cfa14755a4c7b79a542a2b66 [2022-04-15 07:52:50,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:52:50,794 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:52:50,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:52:50,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:52:50,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:52:50,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:52:50" (1/1) ... [2022-04-15 07:52:50,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749dad2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:52:50, skipping insertion in model container [2022-04-15 07:52:50,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:52:50" (1/1) ... [2022-04-15 07:52:50,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:52:50,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:52:50,995 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-scaling/dijkstra-u_unwindbound1.c[525,538] [2022-04-15 07:52:51,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:52:51,040 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:52:51,051 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-scaling/dijkstra-u_unwindbound1.c[525,538] [2022-04-15 07:52:51,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:52:51,073 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:52:51,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:52:51 WrapperNode [2022-04-15 07:52:51,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:52:51,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:52:51,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:52:51,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:52:51,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:52:51" (1/1) ... [2022-04-15 07:52:51,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:52:51" (1/1) ... [2022-04-15 07:52:51,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:52:51" (1/1) ... [2022-04-15 07:52:51,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:52:51" (1/1) ... [2022-04-15 07:52:51,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:52:51" (1/1) ... [2022-04-15 07:52:51,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:52:51" (1/1) ... [2022-04-15 07:52:51,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:52:51" (1/1) ... [2022-04-15 07:52:51,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:52:51,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:52:51,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:52:51,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:52:51,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:52:51" (1/1) ... [2022-04-15 07:52:51,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:52:51,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:52:51,164 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-15 07:52:51,176 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-15 07:52:51,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:52:51,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:52:51,190 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:52:51,190 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:52:51,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:52:51,191 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:52:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:52:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:52:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:52:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:52:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 07:52:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:52:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:52:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:52:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:52:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:52:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:52:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:52:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:52:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:52:51,232 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:52:51,233 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:52:51,385 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:52:51,389 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:52:51,390 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 07:52:51,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:52:51 BoogieIcfgContainer [2022-04-15 07:52:51,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:52:51,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:52:51,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:52:51,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:52:51,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:52:50" (1/3) ... [2022-04-15 07:52:51,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c0394a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:52:51, skipping insertion in model container [2022-04-15 07:52:51,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:52:51" (2/3) ... [2022-04-15 07:52:51,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c0394a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:52:51, skipping insertion in model container [2022-04-15 07:52:51,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:52:51" (3/3) ... [2022-04-15 07:52:51,396 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound1.c [2022-04-15 07:52:51,399 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:52:51,399 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:52:51,424 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:52:51,430 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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 [2022-04-15 07:52:51,430 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:52:51,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:52:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 07:52:51,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:52:51,450 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:52:51,451 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:52:51,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:52:51,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-15 07:52:51,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:52:51,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [433632051] [2022-04-15 07:52:51,465 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:52:51,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 2 times [2022-04-15 07:52:51,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:52:51,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541267233] [2022-04-15 07:52:51,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:52:51,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:52:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:52:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:52:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:52:51,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-15 07:52:51,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 07:52:51,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-15 07:52:51,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:52:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:52:51,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 07:52:51,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 07:52:51,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 07:52:51,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-15 07:52:51,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:52:51,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-15 07:52:51,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 07:52:51,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-15 07:52:51,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-15 07:52:51,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-15 07:52:51,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {42#true} is VALID [2022-04-15 07:52:51,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 07:52:51,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 07:52:51,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 07:52:51,639 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-15 07:52:51,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {43#false} is VALID [2022-04-15 07:52:51,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-15 07:52:51,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-15 07:52:51,640 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {43#false} is VALID [2022-04-15 07:52:51,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-15 07:52:51,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-15 07:52:51,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-15 07:52:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:52:51,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:52:51,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541267233] [2022-04-15 07:52:51,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541267233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:52:51,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:52:51,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:52:51,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:52:51,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [433632051] [2022-04-15 07:52:51,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [433632051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:52:51,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:52:51,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:52:51,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306601241] [2022-04-15 07:52:51,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:52:51,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 07:52:51,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:52:51,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:52:51,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:52:51,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:52:51,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:52:51,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:52:51,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:52:51,697 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:52:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:52:56,343 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-15 07:52:56,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:52:56,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 07:52:56,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:52:56,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:52:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-15 07:52:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:52:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-15 07:52:56,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-15 07:52:56,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:52:56,479 INFO L225 Difference]: With dead ends: 70 [2022-04-15 07:52:56,479 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 07:52:56,481 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-15 07:52:56,483 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:52:56,484 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:52:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 07:52:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 07:52:56,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:52:56,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:52:56,506 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:52:56,506 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:52:56,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:52:56,510 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-15 07:52:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 07:52:56,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:52:56,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:52:56,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-15 07:52:56,512 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-15 07:52:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:52:56,515 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-15 07:52:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 07:52:56,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:52:56,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:52:56,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:52:56,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:52:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:52:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-15 07:52:56,520 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-15 07:52:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:52:56,520 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-15 07:52:56,520 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:52:56,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2022-04-15 07:52:56,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:52:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-15 07:52:56,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 07:52:56,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:52:56,565 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:52:56,566 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:52:56,566 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:52:56,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:52:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-15 07:52:56,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:52:56,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1593606029] [2022-04-15 07:52:56,576 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:52:56,577 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 2 times [2022-04-15 07:52:56,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:52:56,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882776582] [2022-04-15 07:52:56,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:52:56,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:52:56,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:52:56,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [748105237] [2022-04-15 07:52:56,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:52:56,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:52:56,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:52:56,595 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-15 07:52:56,596 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-15 07:52:56,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:52:56,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:52:56,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 07:52:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:52:56,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:52:56,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {332#true} call ULTIMATE.init(); {332#true} is VALID [2022-04-15 07:52:56,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:52:56,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#(<= ~counter~0 0)} assume true; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:52:56,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#(<= ~counter~0 0)} {332#true} #102#return; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:52:56,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#(<= ~counter~0 0)} call #t~ret7 := main(); {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:52:56,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:52:56,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {340#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:52:56,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#(<= ~counter~0 0)} ~cond := #in~cond; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:52:56,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(<= ~counter~0 0)} assume !(0 == ~cond); {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:52:56,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#(<= ~counter~0 0)} assume true; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:52:56,772 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {340#(<= ~counter~0 0)} {340#(<= ~counter~0 0)} #82#return; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:52:56,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {340#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {340#(<= ~counter~0 0)} is VALID [2022-04-15 07:52:56,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {340#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {374#(<= |main_#t~post5| 0)} is VALID [2022-04-15 07:52:56,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {374#(<= |main_#t~post5| 0)} assume !(#t~post5 < 1);havoc #t~post5; {333#false} is VALID [2022-04-15 07:52:56,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {333#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {333#false} is VALID [2022-04-15 07:52:56,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {333#false} assume !(#t~post6 < 1);havoc #t~post6; {333#false} is VALID [2022-04-15 07:52:56,774 INFO L272 TraceCheckUtils]: 16: Hoare triple {333#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {333#false} is VALID [2022-04-15 07:52:56,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {333#false} ~cond := #in~cond; {333#false} is VALID [2022-04-15 07:52:56,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {333#false} assume 0 == ~cond; {333#false} is VALID [2022-04-15 07:52:56,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {333#false} assume !false; {333#false} is VALID [2022-04-15 07:52:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:52:56,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:52:56,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:52:56,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882776582] [2022-04-15 07:52:56,778 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:52:56,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748105237] [2022-04-15 07:52:56,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748105237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:52:56,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:52:56,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:52:56,780 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:52:56,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1593606029] [2022-04-15 07:52:56,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1593606029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:52:56,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:52:56,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:52:56,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773265286] [2022-04-15 07:52:56,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:52:56,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 07:52:56,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:52:56,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:52:56,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:52:56,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 07:52:56,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:52:56,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 07:52:56,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 07:52:56,798 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:05,787 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-15 07:53:05,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 07:53:05,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 07:53:05,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:53:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-15 07:53:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-15 07:53:05,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-15 07:53:05,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:05,865 INFO L225 Difference]: With dead ends: 55 [2022-04-15 07:53:05,865 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 07:53:05,867 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 07:53:05,870 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:53:05,871 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:53:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 07:53:05,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 07:53:05,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:53:05,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:05,883 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:05,883 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:05,885 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-15 07:53:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 07:53:05,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:05,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:53:05,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-15 07:53:05,886 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-15 07:53:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:05,891 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-15 07:53:05,891 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 07:53:05,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:05,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:53:05,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:53:05,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:53:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:53:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-15 07:53:05,895 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-15 07:53:05,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:53:05,895 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-15 07:53:05,895 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:05,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2022-04-15 07:53:05,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 07:53:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 07:53:05,944 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:53:05,951 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:53:05,985 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-15 07:53:06,167 WARN L460 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-15 07:53:06,168 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:53:06,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:53:06,169 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-15 07:53:06,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:53:06,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [670873907] [2022-04-15 07:53:06,179 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:53:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 2 times [2022-04-15 07:53:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:53:06,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601873715] [2022-04-15 07:53:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:53:06,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:53:06,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:53:06,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1356886408] [2022-04-15 07:53:06,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:53:06,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:53:06,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:53:06,226 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-15 07:53:06,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 07:53:06,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:53:06,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:53:06,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:53:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:53:06,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:53:06,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {649#true} is VALID [2022-04-15 07:53:06,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {649#true} is VALID [2022-04-15 07:53:06,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-15 07:53:06,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {649#true} {649#true} #102#return; {649#true} is VALID [2022-04-15 07:53:06,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {649#true} call #t~ret7 := main(); {649#true} is VALID [2022-04-15 07:53:06,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {649#true} is VALID [2022-04-15 07:53:06,385 INFO L272 TraceCheckUtils]: 6: Hoare triple {649#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {649#true} is VALID [2022-04-15 07:53:06,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#true} ~cond := #in~cond; {649#true} is VALID [2022-04-15 07:53:06,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {649#true} assume !(0 == ~cond); {649#true} is VALID [2022-04-15 07:53:06,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-15 07:53:06,385 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {649#true} {649#true} #82#return; {649#true} is VALID [2022-04-15 07:53:06,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {649#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {687#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:53:06,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {687#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {687#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:53:06,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {687#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 1);havoc #t~post5; {687#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:53:06,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {687#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {687#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:53:06,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {687#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {687#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:53:06,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {687#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(#t~post6 < 1);havoc #t~post6; {687#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 07:53:06,389 INFO L272 TraceCheckUtils]: 17: Hoare triple {687#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {706#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:53:06,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {706#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {710#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:53:06,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {710#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {650#false} is VALID [2022-04-15 07:53:06,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-04-15 07:53:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:53:06,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:53:06,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:53:06,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601873715] [2022-04-15 07:53:06,391 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:53:06,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356886408] [2022-04-15 07:53:06,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356886408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:53:06,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:53:06,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:53:06,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:53:06,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [670873907] [2022-04-15 07:53:06,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [670873907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:53:06,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:53:06,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:53:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999400784] [2022-04-15 07:53:06,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:53:06,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 07:53:06,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:53:06,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:53:06,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:06,411 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:53:06,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:53:06,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:53:06,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:53:06,412 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:53:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:13,074 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-04-15 07:53:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:53:13,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 07:53:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:53:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:53:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-15 07:53:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:53:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-15 07:53:13,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-15 07:53:13,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:13,149 INFO L225 Difference]: With dead ends: 54 [2022-04-15 07:53:13,149 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 07:53:13,149 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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-15 07:53:13,150 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:53:13,150 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 151 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 07:53:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 07:53:13,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 07:53:13,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:53:13,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:53:13,166 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:53:13,166 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:53:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:13,168 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-04-15 07:53:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-04-15 07:53:13,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:13,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:53:13,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 51 states. [2022-04-15 07:53:13,170 INFO L87 Difference]: Start difference. First operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 51 states. [2022-04-15 07:53:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:13,172 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-04-15 07:53:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-04-15 07:53:13,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:13,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:53:13,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:53:13,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:53:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:53:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2022-04-15 07:53:13,175 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 21 [2022-04-15 07:53:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:53:13,175 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2022-04-15 07:53:13,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:53:13,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 71 transitions. [2022-04-15 07:53:13,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-04-15 07:53:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 07:53:13,247 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:53:13,247 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:53:13,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 07:53:13,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 07:53:13,448 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:53:13,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:53:13,448 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-15 07:53:13,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:53:13,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1448503451] [2022-04-15 07:53:13,449 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:53:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 2 times [2022-04-15 07:53:13,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:53:13,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804494391] [2022-04-15 07:53:13,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:53:13,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:53:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:53:13,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:53:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:53:13,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {1042#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1035#(<= 0 ~counter~0)} is VALID [2022-04-15 07:53:13,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {1035#(<= 0 ~counter~0)} assume true; {1035#(<= 0 ~counter~0)} is VALID [2022-04-15 07:53:13,565 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1035#(<= 0 ~counter~0)} {1030#true} #102#return; {1035#(<= 0 ~counter~0)} is VALID [2022-04-15 07:53:13,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:53:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:53:13,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {1030#true} ~cond := #in~cond; {1030#true} is VALID [2022-04-15 07:53:13,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {1030#true} assume !(0 == ~cond); {1030#true} is VALID [2022-04-15 07:53:13,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {1030#true} assume true; {1030#true} is VALID [2022-04-15 07:53:13,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1030#true} {1035#(<= 0 ~counter~0)} #82#return; {1035#(<= 0 ~counter~0)} is VALID [2022-04-15 07:53:13,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {1030#true} call ULTIMATE.init(); {1042#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:53:13,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1035#(<= 0 ~counter~0)} is VALID [2022-04-15 07:53:13,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {1035#(<= 0 ~counter~0)} assume true; {1035#(<= 0 ~counter~0)} is VALID [2022-04-15 07:53:13,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1035#(<= 0 ~counter~0)} {1030#true} #102#return; {1035#(<= 0 ~counter~0)} is VALID [2022-04-15 07:53:13,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {1035#(<= 0 ~counter~0)} call #t~ret7 := main(); {1035#(<= 0 ~counter~0)} is VALID [2022-04-15 07:53:13,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {1035#(<= 0 ~counter~0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1035#(<= 0 ~counter~0)} is VALID [2022-04-15 07:53:13,580 INFO L272 TraceCheckUtils]: 6: Hoare triple {1035#(<= 0 ~counter~0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1030#true} is VALID [2022-04-15 07:53:13,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#true} ~cond := #in~cond; {1030#true} is VALID [2022-04-15 07:53:13,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {1030#true} assume !(0 == ~cond); {1030#true} is VALID [2022-04-15 07:53:13,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {1030#true} assume true; {1030#true} is VALID [2022-04-15 07:53:13,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1030#true} {1035#(<= 0 ~counter~0)} #82#return; {1035#(<= 0 ~counter~0)} is VALID [2022-04-15 07:53:13,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {1035#(<= 0 ~counter~0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1035#(<= 0 ~counter~0)} is VALID [2022-04-15 07:53:13,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {1035#(<= 0 ~counter~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1040#(<= 1 ~counter~0)} is VALID [2022-04-15 07:53:13,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {1040#(<= 1 ~counter~0)} assume !!(#t~post5 < 1);havoc #t~post5; {1040#(<= 1 ~counter~0)} is VALID [2022-04-15 07:53:13,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {1040#(<= 1 ~counter~0)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1040#(<= 1 ~counter~0)} is VALID [2022-04-15 07:53:13,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {1040#(<= 1 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1041#(<= 1 |main_#t~post6|)} is VALID [2022-04-15 07:53:13,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {1041#(<= 1 |main_#t~post6|)} assume !!(#t~post6 < 1);havoc #t~post6; {1031#false} is VALID [2022-04-15 07:53:13,583 INFO L272 TraceCheckUtils]: 17: Hoare triple {1031#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1031#false} is VALID [2022-04-15 07:53:13,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {1031#false} ~cond := #in~cond; {1031#false} is VALID [2022-04-15 07:53:13,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {1031#false} assume 0 == ~cond; {1031#false} is VALID [2022-04-15 07:53:13,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {1031#false} assume !false; {1031#false} is VALID [2022-04-15 07:53:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:53:13,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:53:13,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804494391] [2022-04-15 07:53:13,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804494391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:53:13,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:53:13,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:53:13,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:53:13,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1448503451] [2022-04-15 07:53:13,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1448503451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:53:13,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:53:13,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:53:13,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281932559] [2022-04-15 07:53:13,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:53:13,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 07:53:13,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:53:13,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:13,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:13,598 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:53:13,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:53:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:53:13,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:53:13,599 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:14,040 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2022-04-15 07:53:14,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:53:14,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 07:53:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:53:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-15 07:53:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:14,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-15 07:53:14,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-15 07:53:14,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:14,087 INFO L225 Difference]: With dead ends: 63 [2022-04-15 07:53:14,088 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 07:53:14,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:53:14,089 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:53:14,089 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 37 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 07:53:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 07:53:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 07:53:14,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:53:14,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:53:14,113 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:53:14,113 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:53:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:14,114 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 07:53:14,114 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 07:53:14,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:14,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:53:14,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-15 07:53:14,115 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-15 07:53:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:14,115 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 07:53:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 07:53:14,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:14,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:53:14,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:53:14,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:53:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:53:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-15 07:53:14,117 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 21 [2022-04-15 07:53:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:53:14,117 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-15 07:53:14,117 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:53:14,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-15 07:53:14,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:14,145 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 07:53:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 07:53:14,146 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:53:14,146 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:53:14,146 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 07:53:14,146 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:53:14,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:53:14,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1439696200, now seen corresponding path program 1 times [2022-04-15 07:53:14,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:53:14,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2110821660] [2022-04-15 07:53:14,147 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:53:14,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1439696200, now seen corresponding path program 2 times [2022-04-15 07:53:14,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:53:14,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755997976] [2022-04-15 07:53:14,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:53:14,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:53:14,158 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:53:14,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1297584447] [2022-04-15 07:53:14,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:53:14,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:53:14,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:53:14,159 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) [2022-04-15 07:53:14,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 07:53:14,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:53:14,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:53:14,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:53:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:53:14,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:53:14,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {1294#true} call ULTIMATE.init(); {1294#true} is VALID [2022-04-15 07:53:14,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {1294#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1294#true} is VALID [2022-04-15 07:53:14,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {1294#true} assume true; {1294#true} is VALID [2022-04-15 07:53:14,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1294#true} {1294#true} #102#return; {1294#true} is VALID [2022-04-15 07:53:14,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {1294#true} call #t~ret7 := main(); {1294#true} is VALID [2022-04-15 07:53:14,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {1294#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1294#true} is VALID [2022-04-15 07:53:14,295 INFO L272 TraceCheckUtils]: 6: Hoare triple {1294#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1294#true} is VALID [2022-04-15 07:53:14,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {1294#true} ~cond := #in~cond; {1294#true} is VALID [2022-04-15 07:53:14,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {1294#true} assume !(0 == ~cond); {1294#true} is VALID [2022-04-15 07:53:14,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {1294#true} assume true; {1294#true} is VALID [2022-04-15 07:53:14,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1294#true} {1294#true} #82#return; {1294#true} is VALID [2022-04-15 07:53:14,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {1294#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:53:14,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:53:14,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 1);havoc #t~post5; {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:53:14,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:53:14,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:53:14,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(#t~post6 < 1);havoc #t~post6; {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:53:14,298 INFO L272 TraceCheckUtils]: 17: Hoare triple {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1294#true} is VALID [2022-04-15 07:53:14,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {1294#true} ~cond := #in~cond; {1294#true} is VALID [2022-04-15 07:53:14,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {1294#true} assume !(0 == ~cond); {1294#true} is VALID [2022-04-15 07:53:14,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {1294#true} assume true; {1294#true} is VALID [2022-04-15 07:53:14,299 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1294#true} {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #96#return; {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 07:53:14,300 INFO L272 TraceCheckUtils]: 22: Hoare triple {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 + ~r~0) % 4294967296 then 1 else 0)); {1366#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:53:14,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {1366#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1370#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:53:14,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {1370#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1295#false} is VALID [2022-04-15 07:53:14,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {1295#false} assume !false; {1295#false} is VALID [2022-04-15 07:53:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:53:14,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:53:14,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:53:14,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755997976] [2022-04-15 07:53:14,301 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:53:14,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297584447] [2022-04-15 07:53:14,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297584447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:53:14,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:53:14,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:53:14,302 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:53:14,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2110821660] [2022-04-15 07:53:14,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2110821660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:53:14,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:53:14,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:53:14,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092065961] [2022-04-15 07:53:14,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:53:14,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 07:53:14,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:53:14,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:53:14,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:14,318 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:53:14,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:53:14,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:53:14,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:53:14,319 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:53:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:14,430 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 07:53:14,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:53:14,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 07:53:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:53:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:53:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-15 07:53:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:53:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-15 07:53:14,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-15 07:53:14,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:14,450 INFO L225 Difference]: With dead ends: 29 [2022-04-15 07:53:14,450 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 07:53:14,450 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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-15 07:53:14,451 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:53:14,451 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 74 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:53:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 07:53:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 07:53:14,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:53:14,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-15 07:53:14,452 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-15 07:53:14,452 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-15 07:53:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:14,452 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:53:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:53:14,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:14,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:53:14,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) Second operand 0 states. [2022-04-15 07:53:14,453 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) Second operand 0 states. [2022-04-15 07:53:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:53:14,453 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:53:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:53:14,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:14,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:53:14,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:53:14,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:53:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-15 07:53:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 07:53:14,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-15 07:53:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:53:14,453 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 07:53:14,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:53:14,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 07:53:14,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:53:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:53:14,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:53:14,456 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 07:53:14,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 07:53:14,656 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:53:14,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 07:53:14,981 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-15 07:53:14,981 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-15 07:53:14,981 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-15 07:53:14,981 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-15 07:53:14,981 INFO L885 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: true [2022-04-15 07:53:14,981 INFO L885 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: true [2022-04-15 07:53:14,981 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: true [2022-04-15 07:53:14,981 INFO L878 garLoopResultBuilder]: At program point L31(lines 31 32) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 1 ~counter~0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,981 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 20 61) the Hoare annotation is: true [2022-04-15 07:53:14,982 INFO L878 garLoopResultBuilder]: At program point L52(lines 52 55) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,982 INFO L878 garLoopResultBuilder]: At program point L52-2(lines 20 61) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 1 ~counter~0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,982 INFO L878 garLoopResultBuilder]: At program point L44(lines 38 56) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,982 INFO L878 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,982 INFO L878 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 1 ~counter~0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,982 INFO L878 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,982 INFO L878 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,982 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,982 INFO L878 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,982 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 20 61) the Hoare annotation is: true [2022-04-15 07:53:14,982 INFO L878 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,982 INFO L878 garLoopResultBuilder]: At program point L38(lines 38 56) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 1 ~counter~0) (= main_~h~0 0) (<= 1 |main_#t~post6|)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,982 INFO L878 garLoopResultBuilder]: At program point L38-2(lines 38 56) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 1 ~counter~0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,982 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 20 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,983 INFO L878 garLoopResultBuilder]: At program point L30-1(lines 30 35) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 1 ~counter~0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,983 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 35) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 0 ~counter~0) (= main_~h~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,983 INFO L885 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: true [2022-04-15 07:53:14,983 INFO L878 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,983 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,983 INFO L878 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 07:53:14,983 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 07:53:14,983 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 07:53:14,983 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 07:53:14,983 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:53:14,983 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 07:53:14,983 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 07:53:14,983 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:53:14,983 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-15 07:53:14,983 INFO L878 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 07:53:14,984 INFO L878 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 07:53:14,984 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (or (not (<= 1 ~counter~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 07:53:14,984 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (or (not (<= 1 ~counter~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 07:53:14,984 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 07:53:14,986 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2] [2022-04-15 07:53:14,987 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 07:53:14,989 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:53:14,992 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 07:53:15,017 INFO L163 areAnnotationChecker]: CFG has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 07:53:15,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 07:53:15 BoogieIcfgContainer [2022-04-15 07:53:15,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 07:53:15,025 INFO L158 Benchmark]: Toolchain (without parser) took 24230.43ms. Allocated memory was 219.2MB in the beginning and 315.6MB in the end (delta: 96.5MB). Free memory was 164.7MB in the beginning and 154.2MB in the end (delta: 10.4MB). Peak memory consumption was 107.9MB. Max. memory is 8.0GB. [2022-04-15 07:53:15,025 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 219.2MB. Free memory is still 180.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:53:15,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.35ms. Allocated memory is still 219.2MB. Free memory was 164.5MB in the beginning and 189.4MB in the end (delta: -24.9MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. [2022-04-15 07:53:15,025 INFO L158 Benchmark]: Boogie Preprocessor took 43.00ms. Allocated memory is still 219.2MB. Free memory was 189.4MB in the beginning and 187.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 07:53:15,026 INFO L158 Benchmark]: RCFGBuilder took 272.94ms. Allocated memory is still 219.2MB. Free memory was 187.9MB in the beginning and 173.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-15 07:53:15,026 INFO L158 Benchmark]: TraceAbstraction took 23632.33ms. Allocated memory was 219.2MB in the beginning and 315.6MB in the end (delta: 96.5MB). Free memory was 173.4MB in the beginning and 154.2MB in the end (delta: 19.1MB). Peak memory consumption was 116.5MB. Max. memory is 8.0GB. [2022-04-15 07:53:15,027 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 219.2MB. Free memory is still 180.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 276.35ms. Allocated memory is still 219.2MB. Free memory was 164.5MB in the beginning and 189.4MB in the end (delta: -24.9MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.00ms. Allocated memory is still 219.2MB. Free memory was 189.4MB in the beginning and 187.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 272.94ms. Allocated memory is still 219.2MB. Free memory was 187.9MB in the beginning and 173.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 23632.33ms. Allocated memory was 219.2MB in the beginning and 315.6MB in the end (delta: 96.5MB). Free memory was 173.4MB in the beginning and 154.2MB in the end (delta: 19.1MB). Peak memory consumption was 116.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 21.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 434 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 248 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 186 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=3, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 261 PreInvPairs, 295 NumberOfFragments, 375 HoareAnnotationTreeSize, 261 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 177 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (!(\old(counter) <= 0) || (((p == 0 && n == r) && 0 <= counter) && h == 0)) || !(0 <= \old(counter)) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (!(1 <= counter) || !(1 <= \old(cond))) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-15 07:53:15,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...